Sciweavers

2342 search results - page 257 / 469
» Sublinear geometric algorithms
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 6 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
ICCAD
2008
IEEE
129views Hardware» more  ICCAD 2008»
16 years 3 months ago
A capacitance solver for incremental variation-aware extraction
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 12 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
SIGGRAPH
1999
ACM
15 years 11 months ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe