Sciweavers

56 search results - page 5 / 12
» (Not) Bounding the True Error
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 9 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
ALMOB
2008
92views more  ALMOB 2008»
13 years 8 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
JMLR
2008
111views more  JMLR 2008»
13 years 7 months ago
Ranking Categorical Features Using Generalization Properties
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
Sivan Sabato, Shai Shalev-Shwartz
UAI
1998
13 years 9 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
ECCC
2006
134views more  ECCC 2006»
13 years 7 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao