Sciweavers

3145 search results - page 545 / 629
» Algebraic Linear Orderings
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
ICPR
2010
IEEE
15 years 4 months ago
Decision Fusion for Patch-Based Face Recognition
—Patch-based face recognition is a recent method which uses the idea of analyzing face images locally, in order to reduce the effects of illumination changes and partial occlusio...
Berkay Topcu, Hakan Erdogan
124
Voted
CG
2008
Springer
15 years 4 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
CGF
2008
188views more  CGF 2008»
15 years 4 months ago
Real-Time Rendering and Editing of Vector-based Terrains
We present a method to populate very large terrains with very detailed features such as roads, rivers, lakes and fields. These features can be interactively edited, and the landsc...
Eric Bruneton, Fabrice Neyret
104
Voted
COR
2010
164views more  COR 2010»
15 years 4 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz