453 search results - page 76 / 91 » Tight bounds for the partial-sums problem |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Application of Discrete Multi-tone (DMT) signaling to high-speed backplane interconnects requires major modifications to the well-known analysis methods applied to wireline com...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Abstract— Many of today’s data-intensive applications manipulate disk-resident data sets. As a result, their overall behavior is tightly coupled with their disk performance. Un...
COLT
2005
Springer
14 years 28 days ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...