Sciweavers

3514 search results - page 75 / 703
» A search space
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 4 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
14 years 2 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
NIPS
2003
13 years 11 months ago
Bounded Finite State Controllers
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
Pascal Poupart, Craig Boutilier
ECSQARU
2001
Springer
14 years 2 months ago
The Search of Causal Orderings: A Short Cut for Learning Belief Networks
Abstract. Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the netw...
Silvia Acid, Luis M. de Campos, Juan F. Huete
ADC
2003
Springer
127views Database» more  ADC 2003»
14 years 3 months ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu