1068 search results - page 78 / 214 » Factorization as a Rank 1 Problem |
155
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
104
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
135
click to vote
DAM
2010
15 years 3 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
137
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
125
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...