Sciweavers

1091 search results - page 46 / 219
» On the temporal dimension of search
Sort
View
NIPS
1993
15 years 2 months ago
Temporal Difference Learning of Position Evaluation in the Game of Go
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...
WWW
2009
ACM
16 years 2 months ago
The value of socially tagged urls for a search engine
Social bookmarking has emerged as a growing source of human generated content on the web. In essence, bookmarking involves URLs and tags on them. In this paper, we perform a large...
Santanu Kolay, Ali Dasdan
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
15 years 2 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
COMPGEOM
1995
ACM
15 years 5 months ago
Approximate Range Searching
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
Sunil Arya, David M. Mount
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
16 years 2 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...