Sciweavers

230 search results - page 17 / 46
» Data Structures for Restricted Triangular Range Searching
Sort
View
AAAI
1997
14 years 11 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
DEXAW
2007
IEEE
138views Database» more  DEXAW 2007»
15 years 4 months ago
Machine Learning for Question Answering from Tabular Data
Question Answering (QA) systems automatically answer natural language questions in a human-like manner. One of the practical approaches to open domain QA consists in extracting fa...
Mahboob Alam Khalid, Valentin Jijkoun, Maarten de ...
85
Voted
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
15 years 9 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 2 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
82
Voted
ICML
2010
IEEE
14 years 10 months ago
Hilbert Space Embeddings of Hidden Markov Models
Hidden Markov Models (HMMs) are important tools for modeling sequence data. However, they are restricted to discrete latent states, and are largely restricted to Gaussian and disc...
Le Song, Sajid M. Siddiqi, Geoffrey J. Gordon, Ale...