Sciweavers

1283 search results - page 9 / 257
» Probabilistic structured query methods
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
BMCBI
2006
159views more  BMCBI 2006»
13 years 7 months ago
Prediction of protein continuum secondary structure with probabilistic models based on NMR solved structures
Background: The structure of proteins may change as a result of the inherent flexibility of some protein regions. We develop and explore probabilistic machine learning methods for...
Mikael Bodén, Zheng Yuan, Timothy L. Bailey
SIGIR
2006
ACM
14 years 1 months ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
BMCBI
2005
125views more  BMCBI 2005»
13 years 7 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 8 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...