1405 search results - page 167 / 281 » Anytime Algorithm for Feature Selection |
140
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
100
click to vote
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
We present a robust algorithm for point tracking on deformable objects. The key elements are the use of orientation selective rank features (ranklets), local filter adaptation and...
108
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
102
click to vote
MLDM
2009
Springer
15 years 9 months ago
2009
Springer
We consider a new data mining problem of detecting the members of a rare class of data, the needles, that have been hidden in a set of records, the haystack. Besides the haystack, ...