Sciweavers

505 search results - page 36 / 101
» Optimization of Collective Reduction Operations
Sort
View
ICIAP
2007
ACM
15 years 9 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
DSD
2002
IEEE
95views Hardware» more  DSD 2002»
15 years 2 months ago
Decision Diagram Optimization Using Copy Properties
In this paper, we propose an approach to the reduction of sizes of Multi-Terminal Binary Decision Diagrams (MTBDDs) [3] by using the copy properties of discrete functions. The und...
Dragan Jankovic, Radomir S. Stankovic, Rolf Drechs...
JMMA
2002
71views more  JMMA 2002»
14 years 9 months ago
Optimal Hierarchies for Quadrilateral Surfaces
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu
TJS
2002
122views more  TJS 2002»
14 years 9 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
MP
2010
135views more  MP 2010»
14 years 8 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal