Sciweavers

2647 search results - page 79 / 530
» Solving Term Inequalities
Sort
View
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
16 years 6 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
SSS
2007
Springer
121views Control Systems» more  SSS 2007»
16 years 11 days ago
Byzantine Self-stabilizing Pulse in a Bounded-Delay Model
Abstract. “Pulse Synchronization” intends to invoke a recurring distributed event at the different nodes, of a distributed system as simultaneously as possible and with a freq...
Danny Dolev, Ezra N. Hoch
FOCS
2006
IEEE
16 years 9 days ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
IPSN
2004
Springer
15 years 11 months ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
ECOOP
2000
Springer
15 years 10 months ago
Copying and Comparing: Problems and Solutions
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
Peter Grogono, Markku Sakkinen