Sciweavers

126 search results - page 24 / 26
» Query answering exploiting structural properties
Sort
View
BMCBI
2005
119views more  BMCBI 2005»
13 years 10 months ago
The distance-profile representation and its application to detection of distantly related protein families
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
Chin-Jen Ku, Golan Yona
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 8 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 4 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
AAAI
1998
14 years 6 days ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 5 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan