1279 search results - page 241 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
ATAL
2009
Springer
13 years 8 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...