1068 search results - page 61 / 214 » Factorization as a Rank 1 Problem |
101
click to vote
STOC
2012
ACM
13 years 8 days ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
ICALP
1992
Springer
15 years 1 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
159
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We describe DSPHERE1 - a decentralized system for crawling, indexing, searching and ranking of documents in the World Wide Web. Unlike most of the existing search technologies tha...
FOSSACS
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
127
click to vote
PAMI
2012
13 years 8 days ago
2012
—We present a novel framework to generate and rank plausible hypotheses for the spatial extent of objects in images using bottom-up computational processes and mid-level selectio...