Sciweavers

654 search results - page 81 / 131
» Multiplexing for Optimal Lighting
Sort
View
CSC
2009
13 years 8 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini
MVA
2002
116views Computer Vision» more  MVA 2002»
13 years 7 months ago
Nonlinear Refinement of Camera Parameters Using an Endoscopic Surgery Robot
We present an approach for nonlinear optimization of the parameters of an endoscopic camera mounted on a surgery robot. The goal is to generate a depth map for each image in order...
Jochen Schmidt, Florian Vogt, Heinrich Niemann
PE
2010
Springer
137views Optimization» more  PE 2010»
13 years 6 months ago
Tail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
Jayakrishnan Nair, Adam Wierman, Bert Zwart
APVIS
2011
12 years 7 months ago
Full-resolution interactive CPU volume rendering with coherent BVH traversal
We present an efficient method for volume rendering by raycasting on the CPU. We employ coherent packet traversal of an implicit bounding volume hierarchy, heuristically pruned u...
Aaron Knoll, Sebastian Thelen, Ingo Wald, Charles ...