Sciweavers

13603 search results - page 335 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
176
Voted
TOG
2008
79views more  TOG 2008»
15 years 7 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»
15 years 2 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
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
16 years 21 days ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
ICFP
2007
ACM
16 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
160
Voted
ICIP
2004
IEEE
16 years 9 months ago
Video encoder complexity reduction by estimating skip mode distortion
DCT-based CODECs such as MPEG-4 Visual and H.263 "skip" many macroblocks during encoding of typical video sequences (i.e. no coded data is transmitted for these macroblo...
Iain E. Garden Richardson, Yafan Zhao