Sciweavers

841 search results - page 88 / 169
» Approximability of Minimum AND-Circuits
Sort
View
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
15 years 10 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
VLDB
1990
ACM
179views Database» more  VLDB 1990»
15 years 10 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish
CISS
2007
IEEE
15 years 10 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ECCV
2010
Springer
15 years 10 months ago
Geometry Construction from Caustic Images
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 10 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ