1661 search results - page 88 / 333 » Decision Tree Fields |
161
click to vote
TOC
2010
15 years 1 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
148
click to vote
ALENEX
2003
15 years 7 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
190
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
161
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
Web search engines work well for finding crawlable pages, but not for finding datasets hidden behind Web search forms. We describe a novel technique for detecting search forms, ...
159
click to vote
ICDM
2008
IEEE
16 years 23 days ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...