Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@benb@osintua.eu
2026-02-09 16:57:16

Ukraine’s communications system is crumbling amid blackouts, MP Fediienko warns: benborges.xyz/2026/02/09/ukrai

@vosje62@mastodon.nl
2026-01-09 05:27:32

KLM-topvrouw na rampweek op Schiphol: ‘Onze communicatie naar reizigers moet beter’ | Trouw
#Schiphol #KLM

@servelan@newsie.social
2026-03-09 00:42:43

Coming Soon, From the People Behind ICE Detention Camps: Data Center Company Towns
gizmodo.com/coming-soon-from-t

@memeorandum@universeodon.com
2026-03-09 12:25:41

'Nobody Could Have Seen This Coming,' Says Blindfolded Administration (Daniel W. Drezner/Drezner's World)
danieldrezner.substack.com/p/n
memeorandum.com/260309/p26#a26

@arXiv_csGT_bot@mastoxiv.page
2025-12-09 07:47:37

The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang
arxiv.org/abs/2512.06585 arxiv.org/pdf/2512.06585 arxiv.org/html/2512.06585
arXiv:2512.06585v1 Announce Type: new
Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with bidders from either a standard valuation class (which require exponential communication to explicitly state, such as subadditive or XOS), or arbitrary succinct valuations (which can be fully described in polynomial communication, such as single-minded). Although succinct valuations can be efficiently communicated, we show that additional succinct bidders have a nontrivial impact on communication complexity of classical combinatorial auctions. Specifically, let $n$ be the number of subadditive/XOS bidders. We show that for SA $\cup$ SC (the union of subadditive and succinct valuations): (1) There is a polynomial communication $3$-approximation algorithm; (2) As $n \to \infty$, there is a matching $3$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $2$ for SA, and (b) holds even for SA $\cup$ SM (the union of subadditive and single-minded valuations); and (3) For all $n \geq 3$, there is a constant separation between the optimal approximation ratios for SA $\cup$ SM and SA (and therefore between SA $\cup$ SC and SA as well). Similarly, we show that for XOS $\cup$ SC: (1) There is a polynomial communication $2$-approximation algorithm; (2) As $n \to \infty$, there is a matching $2$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $e/(e-1)$ for XOS, and (b) holds even for XOS $\cup$ SM; and (3) For all $n \geq 2$, there is a constant separation between the optimal approximation ratios for XOS $\cup$ SM and XOS (and therefore between XOS $\cup$ SC and XOS as well).
toXiv_bot_toot

@Techmeme@techhub.social
2026-01-08 00:50:48

Ford plans to launch an AI voice assistant on its apps this year before expanding to its vehicles in 2027, and aims to debut Level 3 autonomous driving in 2028 (Andrew J. Hawkins/The Verge)
theverge.com/transportation/85

@cowboys@darktundra.xyz
2026-01-08 14:06:34

Cowboys Headlines: Ohio State coming to Dallas? Jerry talks Super Bowl cowboyswire.usatoday.com/story

CETI is a nonprofit organization
applying advanced machine learning and state-of-the-art robotics
to listen to and translate the communication of sperm whales.
Our research focus is in Dominica
in the Eastern Caribbean
projectceti.org/

@metacurity@infosec.exchange
2026-02-06 22:56:32

Ahead of the Munich Security Conference, Google issued a call for action to secure the quantum computing era
blog.google/innovation-and-ai/

@memeorandum@universeodon.com
2026-01-08 20:05:58

'Largest economic development in history': $20 billion dollar data center coming to Southaven (Hannah Kozlowski/Action News 5)
actionnews5.com/2026/01/08/lar
memeorandum.com/260108/p106#a2