1813 search results - page 18 / 363 » Instance Pruning Techniques |
132
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
FGR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper a novel ranking-based face recognition (FR) scheme is proposed. Compared with classical twoclass (intra/extra person) and multi-class (each person a single class) sc...
CP
2007
Springer
15 years 6 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
114
click to vote
CC
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
IDEAS
2008
IEEE
15 years 6 months ago
2008
IEEE
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...