29 search results - page 4 / 6 » A Method for Fast Approximate Searching of Polypeptide Struc... |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
FM
2006
Springer
13 years 10 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
JMLR
2010
13 years 1 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...