2168 search results - page 95 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
168
Voted
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. While several data aggregation (i.e., routing with...
126
Voted
UAI
1998
15 years 5 months ago
1998
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
130
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
135
Voted
ATAL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
136
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...