Sciweavers

416 search results - page 72 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
MM
2005
ACM
215views Multimedia» more  MM 2005»
15 years 7 months ago
OpenVIDIA: parallel GPU computer vision
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
James Fung, Steve Mann
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 5 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
INFOCOM
1998
IEEE
15 years 5 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
GIS
2006
ACM
16 years 2 months ago
Object localization based on directional information case of 2D vector data
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
Stelian Coros, JingBo Ni, Pascal Matsakis
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 5 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...