7150 search results - page 427 / 1430 » An Approximation Algorithm for Approximation Rank |
173
Voted
DAM
2010
15 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
171
click to vote
WASA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
183
Voted
ISAAC
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
186
Voted
WEBI
2001
Springer
15 years 11 months ago
2001
Springer
: Automated collaborative filtering is a popular technique for reducing information overload. In this paper, we propose a new approach for the collaborative filtering using local...
191
Voted
CCCG
2010
15 years 8 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...