Sciweavers

3495 search results - page 42 / 699
» On the random satisfiable process
Sort
View
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 3 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
ASUNAM
2010
IEEE
14 years 9 days ago
A Unified Framework for Link Recommendation Using Random Walks
The phenomenal success of social networking sites, such as Facebook, Twitter and LinkedIn, has revolutionized the way people communicate. This paradigm has attracted the attention ...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
TIT
2010
129views Education» more  TIT 2010»
13 years 5 months ago
Random access in wireless networks with overlapping cells
We study cellular-like wireless networks in which the cells may overlap substantially, and a common channel is used for all cells. Thus, transmissions intended for one destination ...
Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Eph...
FOCS
2002
IEEE
14 years 3 months ago
Global Information from Local Observation
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
Itai Benjamini, László Lovász
INFOCOM
2008
IEEE
14 years 5 months ago
Decentralized Rate Regulation in Random Access Channels
—We consider a time-slotted multipacket reception channel, shared by a finite number of mobile users who transmit to a common base station. Each user is allocated a fixed data ...
Ishai Menache, Nahum Shimkin