2479 search results - page 299 / 496 » Random Event Structures |
137
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
176
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
164
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
125
Voted
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
156
click to vote
AMIRE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce mathematically rigorous metrics on agent experiences having various temporal horizons. Sensorimotor variables accessible to the agent are treated as informat...