Sciweavers

2498 search results - page 109 / 500
» Data Structures with Unpredictable Timing
Sort
View
COMPGEOM
1997
ACM
15 years 6 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 2 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
120
Voted
AAAI
2000
15 years 3 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
ISMB
1997
15 years 3 months ago
Standardized Representations of the Literature: Combining Diverse Sources of Ribosomal Data
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...
Russ B. Altman, Neil F. Abernethy, Richard O. Chen
100
Voted
STACS
2005
Springer
15 years 7 months ago
Approximate Range Mode and Range Median Queries
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...