Sciweavers

1089 search results - page 184 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SLIP
2003
ACM
14 years 2 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
COMPGEOM
2010
ACM
14 years 1 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
ECCV
2010
Springer
14 years 1 months ago
Analyzing Depth from Coded Aperture Sets
Computational depth estimation is a central task in computer vision and graphics. A large variety of strategies have been introduced in the past relying on viewpoint variations, de...
IWMM
2010
Springer
211views Hardware» more  IWMM 2010»
13 years 10 months ago
Concurrent, parallel, real-time garbage-collection
With the current developments in CPU implementations, it becomes obvious that ever more parallel multicore systems will be used even in embedded controllers that require real-time...
Fridtjof Siebert
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe