1632 search results - page 223 / 327 » Sublinear Time Algorithms for Metric Space Problems |
201
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML ...
145
click to vote
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
105
click to vote
IJCAI
2001
15 years 5 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
154
click to vote
CCCG
2008
15 years 5 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
158
click to vote
STOC
2005
ACM
15 years 9 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...