Sciweavers

9 search results - page 2 / 2
» Optimal arrangement of data in a tree directory
Sort
View
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
13 years 10 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
HPDC
2007
IEEE
13 years 9 months ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 2 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 9 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant