Sciweavers

2342 search results - page 134 / 469
» Sublinear geometric algorithms
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Approximation of pattern transformation manifolds with parametric dictionaries
The construction of low-dimensional models explaining highdimensional signal observations provides concise and efficient data representations. In this paper, we focus on pattern ...
Elif Vural, Pascal Frossard
EMSOFT
2006
Springer
15 years 4 months ago
Scheduling for multi-threaded real-time programs via path planning
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
Thao Dang, Philippe Gerner
IJCV
2007
157views more  IJCV 2007»
15 years 1 months ago
Recovering Surface Layout from an Image
Humans have an amazing ability to instantly grasp the overall 3D structure of a scene – ground orientation, relative positions of major landmarks, etc – even from a single ima...
Derek Hoiem, Alexei A. Efros, Martial Hebert
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 1 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
3DIM
2007
IEEE
15 years 7 months ago
Multi-View Edge-based Stereo by Incorporating Spatial Coherence
A limitation of the state-of-art multi-view reconstruction algorithms is in their ability to handle scenes with very little texture or a lot of clutter. Texture-less scenes with c...
Gang Li, Yakup Genc, Steven W. Zucker