5100 search results - page 652 / 1020 » The Linear Complexity of a Graph |
185
click to vote
DATE
2010
IEEE
16 years 21 days ago
2010
IEEE
—Bug-free first silicon is not guaranteed by the existing pre-silicon verification techniques. To have impeccable products, it is now required to identify any bug as soon as the ...
201
click to vote
PODC
2009
ACM
16 years 8 days ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
218
click to vote
SEKE
2001
Springer
16 years 19 hour ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
209
click to vote
FOCS
2000
IEEE
16 years 9 hour ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
172
click to vote
POPL
2000
ACM
15 years 12 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...