Sciweavers

5138 search results - page 937 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
15 years 8 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
135
Voted
ICASSP
2009
IEEE
15 years 8 months ago
Scalable distributed source coding
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose
80
Voted
ATAL
2009
Springer
15 years 8 months ago
Context-aware multi-stage routing
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
Adriaan ter Mors, Jeroen van Belle, Cees Witteveen
CIKM
2009
Springer
15 years 8 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
COMPGEOM
2009
ACM
15 years 8 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan