Sciweavers

197 search results - page 39 / 40
» Simple deterministic approximation algorithms for counting m...
Sort
View
CODES
2003
IEEE
14 years 27 days ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere
COCOON
2007
Springer
14 years 1 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
MM
2005
ACM
215views Multimedia» more  MM 2005»
14 years 1 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»
13 years 11 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
SIGGRAPH
1996
ACM
13 years 11 months ago
Light Field Rendering
A number of techniques have been proposed for flying through scenes by redisplaying previously rendered or digitized views. Techniques have also been proposed for interpolating be...
Marc Levoy, Pat Hanrahan