237 search results - page 43 / 48 » Approximation Algorithms for Minimum Tree Partition |
116
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
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 ...
104
Voted
MOBIHOC
2006
ACM
16 years 22 days ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
111
Voted
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
112
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
182
Voted
VLDB
2004
ACM
16 years 1 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...