402 search results - page 33 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
WABI
2004
Springer
15 years 5 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
101
Voted
RECSYS
2010
ACM
15 years 20 days ago
2010
ACM
Collaborative filtering is a popular approach for building recommender systems. Current collaborative filtering algorithms are accurate but also computationally expensive, and so ...
DISOPT
2010
15 years 16 days ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
210
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
244
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...