Sciweavers

10608 search results - page 466 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
157
Voted
FCS
2006
15 years 6 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
TOG
2008
79views more  TOG 2008»
15 years 4 months ago
Continuous model synthesis
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
Paul Merrell, Dinesh Manocha
TIT
2010
124views Education» more  TIT 2010»
14 years 11 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
ICIP
2001
IEEE
16 years 6 months ago
Fast algorithms for DCT-domain video transcoding
Video transcoding is an efficient way for. rate adaptation and format conversion in various networked video applications. Many transcoder architectures have been proposed to achie...
Chia-Wen Lin, Yuh-Ruey Lee
ICML
2007
IEEE
16 years 5 months ago
Non-isometric manifold learning: analysis and an algorithm
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
Piotr Dollár, Serge J. Belongie, Vincent Ra...