Sciweavers

248 search results - page 47 / 50
» Geometrical Probability Covering Algorithm
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CIKM
2009
Springer
14 years 1 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...
IPSN
2007
Springer
14 years 1 months ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...
COMPGEOM
2004
ACM
14 years 23 days ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu
WSNA
2003
ACM
14 years 18 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li