3946 search results - page 265 / 790 » The computational complexity of choice sets |
224
click to vote
JMLR
2010
15 years 1 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
163
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
184
click to vote
CASES
2003
ACM
15 years 12 months ago
2003
ACM
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
183
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Microarray compendia profile the expression of genes in a number of experimental conditions. Such data compendia are useful not only to group genes and conditions base...
175
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...