3946 search results - page 324 / 790 » The computational complexity of choice sets |
235
click to vote
DCC
2000
IEEE
15 years 12 months ago
2000
IEEE
This paper contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization ...
201
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: High-throughput sequencing technologies, such as the Illumina Genome Analyzer, are powerful new tools for investigating a wide range of biological and medical question...
300
click to vote
TOG
2012
13 years 10 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
219
click to vote
SIAMCOMP
1998
15 years 7 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
243
click to vote
ISBI
2009
IEEE
16 years 2 months ago
2009
IEEE
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...