Sciweavers

500 search results - page 90 / 100
» Approximation algorithms for maximum independent set of pseu...
Sort
View
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 3 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
121
Voted
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
15 years 6 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
ALT
2008
Springer
15 years 10 months ago
Optimally Learning Social Networks with Activations and Suppressions
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
Dana Angluin, James Aspnes, Lev Reyzin
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
15 years 8 months ago
Lane boundary and curb estimation with lateral uncertainties
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
Albert S. Huang, Seth J. Teller
FOCS
2000
IEEE
15 years 6 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber