Sciweavers

417 search results - page 64 / 84
» Convex Shape Decomposition
Sort
View
PPL
2006
93views more  PPL 2006»
13 years 7 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl
TIP
2008
85views more  TIP 2008»
13 years 7 months ago
Resource Allocation for Error Resilient Video Coding Over AWGN Using Optimization Approach
The number of slices for error resilient video coding is jointly optimized with 802.11a-like media access control and the physical layers with automatic repeat request and rate com...
Cheolhong An, Truong Q. Nguyen
TWC
2008
227views more  TWC 2008»
13 years 7 months ago
Cross-layer optimization frameworks for multihop wireless networks using cooperative diversity
We propose cross-layer optimization frameworks for multihop wireless networks using cooperative diversity. These frameworks provide solutions to fundamental relaying problems of de...
Long Le, Ekram Hossain
CG
1999
Springer
13 years 7 months ago
A visibility algorithm for hybrid geometry- and image-based modeling and rendering
Hybrid geometry- and image-based modeling and rendering systems use photographs taken of a real-world environment and mapped onto the surfaces of a 3D model to achieve photorealis...
Thomas A. Funkhouser
CIKM
2010
Springer
13 years 6 months ago
Yes we can: simplex volume maximization for descriptive web-scale matrix factorization
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
Christian Thurau, Kristian Kersting, Christian Bau...