7150 search results - page 406 / 1430 » An Approximation Algorithm for Approximation Rank |
189
click to vote
CSDA
2006
15 years 6 months ago
2006
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
183
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
232
click to vote
SWAT
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
187
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
186
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...