522 search results - page 87 / 105 » Necessary but Not Sufficient |
IPL
2002
13 years 7 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
SIROCCO
2008
13 years 9 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
Due to the inherent nature of their heterogeneity, resource scarcity and dynamism, the provision of middleware for future networked embedded environments is a challenging task. In...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
Everybody agrees that curing DFM/DFY issues is of paramount importance at 65 nanometers and beyond. Unfortunately, there is disagreement about how and when to cure them. “Surgeo...