Sciweavers

11381 search results - page 2271 / 2277
» Connectivity
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
15 years 10 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
MOBIHOC
2008
ACM
15 years 9 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 7 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
EUROSYS
2008
ACM
15 years 6 months ago
Towards cinematic internet video-on-demand
Video-on-demand (VoD) is increasingly popular with Internet users. It gives users greater choice and more control than live streaming or file downloading. Systems such as MSN Vid...
Bin Cheng, Lex Stein, Hai Jin, Zheng Zhang
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
15 years 4 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
« Prev « First page 2271 / 2277 Last » Next »