Sciweavers

2095 search results - page 275 / 419
» Improved pebbling bounds
Sort
View
OSDI
2002
ACM
16 years 7 months ago
TCP Nice: A Mechanism for Background Transfers
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
Arun Venkataramani, Ravi Kokku, Michael Dahlin
ALT
2002
Springer
16 years 3 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
171
Voted
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
16 years 1 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
FM
2009
Springer
157views Formal Methods» more  FM 2009»
16 years 1 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
IDA
2009
Springer
16 years 1 months ago
Extension of Sparse, Adaptive Signal Decompositions to Semi-blind Audio Source Separation
Abstract. We apply sparse, fast and flexible adaptive lapped orthogonal transforms to underdetermined audio source separation using the time-frequency masking framework. This norm...
Andrew Nesbit, Emmanuel Vincent, Mark D. Plumbley