Sciweavers

305 search results - page 9 / 61
» Geometric programming for circuit optimization
Sort
View
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
15 years 3 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers
ICCV
2011
IEEE
13 years 11 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
VTC
2006
IEEE
152views Communications» more  VTC 2006»
15 years 5 months ago
Cross-Layer Resource Allocation via Geometric Programming in Fading Broadcast Channels
Abstract— In a fading broadcast channel (BC), Queue Proportional Scheduling (QPS) is presented via geometric programming (GP). Given the current queue state, QPS allocates a data...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi
COMPGEOM
1998
ACM
15 years 3 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
ICCV
2005
IEEE
16 years 1 months ago
Quasiconvex Optimization for Robust Geometric Reconstruction
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
Qifa Ke, Takeo Kanade