Sciweavers

7150 search results - page 13 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
120
Voted
COCOON
2003
Springer
15 years 7 months ago
Randomized Approximation of the Stable Marriage Problem
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
Magnús M. Halldórsson, Kazuo Iwama, ...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 2 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
126
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 2 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
120
Voted
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 8 days ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
120
Voted
WWW
2005
ACM
16 years 3 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi