Sciweavers

93 search results - page 6 / 19
» Information-Based Nonlinear Approximation: An Average Case S...
Sort
View
WICON
2008
13 years 8 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
DATE
2005
IEEE
129views Hardware» more  DATE 2005»
14 years 17 days ago
Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
A novel energy reduction strategy to maximally exploit the dynamic workload variation is proposed for the offline voltage scheduling of preemptive systems. The idea is to construc...
Lap-Fai Leung, Chi-Ying Tsui, Xiaobo Sharon Hu
CVPR
2005
IEEE
14 years 9 months ago
On Modelling Nonlinear Shape-and-Texture Appearance Manifolds
Statistical shape-and-texture appearance models employ image metamorphosis to form a rich, compact representation of object appearance. They achieve their efficiency by decomposin...
Chris Mario Christoudias, Trevor Darrell
SCALESPACE
2009
Springer
14 years 1 months ago
An Elasticity Approach to Principal Modes of Shape Variation
Abstract. Concepts from elasticity are applied to analyze modes of variation on shapes in two and three dimensions. This approach represents a physically motivated alternative to s...
Martin Rumpf, Benedikt Wirth
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 2 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled