Tootfinder

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

No exact results. Similar results found.
@seeingwithsound@mas.to
2025-12-10 10:36:04

Can a visual neuroprosthesis communicate with the brain? medscape.com/viewarticle/can-v Archived at

@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
2025-12-08 17:35:06

Trump’s Katrina Is Coming - The American Prospect
prospect.org/2025/12/05/trumps

@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

@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

@NFL@darktundra.xyz
2025-12-08 13:05:49

Liam Coen is 'totally fine' with Jaguars not getting respect: 'That's the beauty of it. It ain't coming.' nfl.com/news/liam-coen-is-tota

@arXiv_csCY_bot@mastoxiv.page
2025-10-10 08:35:39

The Right to Communications Confidentiality in Europe: Protecting Privacy, Freedom of Expression, and Trust
Frederik J. Zuiderveen Borgesius, Wilfred Steenbruggen
arxiv.org/abs/2510.08247

@Techmeme@techhub.social
2026-01-09 14:20:57

Sources say DeepSeek will launch its next-generation V4 model in the coming weeks and claim it outperformed Anthropic's Claude and OpenAI's GPT series in coding (The Information)
theinformation.com/articles/de

@blakes7bot@mas.torpidity.net
2025-11-10 07:04:42

#Blakes7 Series B, Episode 13 - Star One
AVON: [On communicator] What is it, Jenna?
JENNA: There's a ship, its coming in for a surface landing.
AVON: [On communicator] Have they spotted you?
JENNA: I've got the detector shield up.

@PaulWermer@sfba.social
2025-11-08 23:33:45

Please sign this petition
I'm a chemist. As a grad student I was a TA and a tutor. I taught college chemistry classes.
That's teaching a subject, not communicating about a technical issue (yes, these really are different skills)
And climate change advocacy has highlighted how difficult communicating is.
I wish this proposal had been enacted when I was a student.
Please sign.