Sciweavers

3049 search results - page 246 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ADHOC
2008
134views more  ADHOC 2008»
15 years 6 months ago
Data aggregated maximum lifetime routing for wireless sensor networks
In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing...
Cunqing Hua, Tak-Shing Peter Yum
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
COLT
2004
Springer
15 years 12 months ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
16 years 3 days ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
ICALP
2004
Springer
15 years 12 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...