Sciweavers

507 search results - page 46 / 102
» Sizes of Ordered Decision Trees
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
CVPR
1998
IEEE
14 years 10 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
SCS
2003
13 years 9 months ago
A New Component Concept for Fault Trees
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...
Bernhard Kaiser, Peter Liggesmeyer, Oliver Mä...
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
13 years 11 months ago
A Comparative Study of Classification Based Personal E-mail Filtering
This paper addresses personal E-mail filtering by casting it in the framework of text classification. Modeled as semi-structured documents, Email messages consist of a set of field...
Yanlei Diao, Hongjun Lu, Dekai Wu