5316 search results - page 1032 / 1064 » Which Search Problems Are Random |
104
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
93
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
119
click to vote
KDD
1998
ACM
15 years 5 months ago
1998
ACM
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Most real-world negotiation scenarios involve multiple, interdependent issues. These scenarios are specially challenging because the agents' utility functions are nonlinear, ...
118
click to vote
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This work presents scale invariant region detectors that apply evolved operators to extract an interest measure. We evaluate operators using their repeatability rate, and...