1068 search results - page 17 / 214 » Factorization as a Rank 1 Problem |
103
click to vote
EMNLP
2009
14 years 7 months ago
2009
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...
101
click to vote
PKC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
78
Voted
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...