1095 search results - page 95 / 219 » Preprocessing of Intractable Problems |
EVOW
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
IPCO
2010
13 years 8 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
CVPR
2001
IEEE
15 years 8 days ago
2001
IEEE
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...