Sciweavers

1283 search results - page 99 / 257
» Probabilistic structured query methods
Sort
View
IJCAI
1997
13 years 10 months ago
Toward Structured Retrieval in Semi-structured Information Spaces
A semi-structured information space consists of multiple collections of textual documents containing fielded or tagged sections. The space can be highly heterogeneous, because eac...
Scott B. Huffman, Catherine Baudin
EDBT
2010
ACM
202views Database» more  EDBT 2010»
14 years 3 months ago
Querying trajectories using flexible patterns
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work ...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
14 years 18 days ago
Evaluation relaxation using substructural information and linear estimation
The paper presents an evaluation-relaxation scheme where a fitness surrogate automatically adapts to the problem structure and the partial contributions of subsolutions to the fit...
Kumara Sastry, Cláudio F. Lima, David E. Go...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 9 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
MICAI
2005
Springer
14 years 2 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...