Sciweavers

497 search results - page 67 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
JGO
2010
100views more  JGO 2010»
14 years 4 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
ICC
2008
IEEE
175views Communications» more  ICC 2008»
15 years 4 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
AMFG
2003
IEEE
244views Biometrics» more  AMFG 2003»
15 years 3 months ago
Manifold of Facial Expression
In this paper, we propose the concept of Manifold of Facial Expression based on the observation that images of a subject’s facial expressions define a smooth manifold in the hig...
Ya Chang, Changbo Hu, Matthew Turk
CAIP
1995
Springer
252views Image Analysis» more  CAIP 1995»
15 years 1 months ago
3D Surface Reconstruction Using Occluding Contours
This paper addresses the problem of 3D surface reconstruction using image sequences. It has been shown that shape recovery from three or more occluding contours of the surface is p...
Edmond Boyer, Marie-Odile Berger
SAC
2006
ACM
15 years 3 months ago
Building the functional performance model of a processor
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
Alexey L. Lastovetsky, Ravi Reddy, Robert Higgins