Sciweavers

756 search results - page 148 / 152
» Model Order Reduction for Nonlinear IC Models
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 9 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
TVCG
2011
163views more  TVCG 2011»
14 years 4 months ago
Scan-Based Volume Animation Driven by Locally Adaptive Articulated Registrations
—This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo...
Taehyun Rhee, John P. Lewis, Ulrich Neumann, Krish...
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
ECCV
2002
Springer
15 years 11 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 7 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...