Sciweavers

745 search results - page 33 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
INFOCOM
2010
IEEE
14 years 11 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
97
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 5 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ISCAS
2007
IEEE
105views Hardware» more  ISCAS 2007»
15 years 6 months ago
Stability Analysis of RED Gateway with Multiple TCP Reno Connections
— It has been observed that a bottleneck Random Early Detection (RED) gateway becomes oscillatory when regulating a flow in multiple TCP connections. The stability boundary of t...
Xi Chen, Siu Chung Wong, Chi K. Michael Tse, Ljilj...
95
Voted
CVIU
2007
113views more  CVIU 2007»
15 years 14 days ago
Primal sketch: Integrating structure and texture
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
87
Voted
FOCS
2003
IEEE
15 years 5 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim