17760 search results - page 351 / 3552 » A Generalization of the Massey-Ding Algorithm |
151
click to vote
TIT
2008
15 years 6 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
176
click to vote
FOCM
2011
15 years 1 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
185
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Consider a distributed system with n nodes where each node holds a multiset of items. In this paper, we design sampling algorithms that allow us to estimate the global frequency...
213
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
170
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...