2168 search results - page 156 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
129
click to vote
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
172
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
130
click to vote
RAS
2000
15 years 3 months ago
2000
Mobile robot navigation under controlled laboratory conditions is, by now, state of the art and reliably achievable. To transfer navigation mechanisms used in such small-scale env...
129
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Particle filters are a frequently used filtering technique in the robotics community. They have been successfully applied to problems such as localization, mapping, o...
144
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...