Sciweavers

239 search results - page 25 / 48
» Localized Upper and Lower Bounds for Some Estimation Problem...
Sort
View
ICALP
2004
Springer
15 years 3 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
CORR
2006
Springer
95views Education» more  CORR 2006»
14 years 9 months ago
Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
SPAA
1995
ACM
15 years 1 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 1 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
ICASSP
2011
IEEE
14 years 1 months ago
Practical limits in RSS-based positioning
Received signal strength (RSS) based source localization papers often ignore the practical effects of range limits in the measurements. In many devices, this results in some senso...
Richard K. Martin, Amanda Sue King, Ryan W. Thomas...