Sciweavers

2542 search results - page 76 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
115
Voted
DAC
2006
ACM
16 years 3 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
108
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
117
Voted
IPPS
2000
IEEE
15 years 7 months ago
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity ON , where 2  3. We show that such an algorithm can be parallelize...
Keqin Li
119
Voted
ECCV
2002
Springer
16 years 4 months ago
Computing the Physical Parameters of Rigid-Body Motion from Video
Abstract. This paper presents an optimization framework for estimating the motion and underlying physical parameters of a rigid body in free flight from video. The algorithm takes ...
Kiran S. Bhat, Steven M. Seitz, Jovan Popovic
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
15 years 7 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...