1772 search results - page 222 / 355 » Classifying Problems into Complexity Classes |
136
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
103
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
118
Voted
TCSV
2008
15 years 18 days ago
2008
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...
93
Voted
CSB
2005
IEEE
15 years 6 months ago
2005
IEEE
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
CVPR
1996
IEEE
16 years 2 months ago
1996
IEEE
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...