Sciweavers

505 search results - page 79 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
ICASSP
2010
IEEE
15 years 2 days ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ECCV
2004
Springer
16 years 1 months ago
Estimating Intrinsic Images from Image Sequences with Biased Illumination
We present a method for estimating intrinsic images from a fixed-viewpoint image sequence captured under changing illumination directions. Previous work on this problem reduces the...
Yasuyuki Matsushita, Stephen Lin, Sing Bing Kang, ...
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
15 years 8 months ago
I/O Clustering in Design Cost and Performance Optimization for Flip-Chip Design
I/O placement has always been a concern in modern IC design. Due to flip-chip technology, I/O can be placed throughout the whole chip without long wires from the periphery of the...
Hung-Ming Chen, I-Min Liu, Martin D. F. Wong, Muzh...
ICCAD
2001
IEEE
127views Hardware» more  ICCAD 2001»
15 years 8 months ago
What is the Limit of Energy Saving by Dynamic Voltage Scaling?
Dynamic voltage scaling (DVS) is a technique that varies the supply voltage and clock frequency based on the computation load to provide desired performance with the minimal amoun...
Gang Qu
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
15 years 4 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...