Sciweavers

817 search results - page 156 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 2 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
INFOCOM
2000
IEEE
13 years 12 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 4 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
JNCA
2011
137views more  JNCA 2011»
13 years 2 months ago
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
Shanshan Jiang, Yuan Xue
ECCV
2002
Springer
14 years 9 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto