1068 search results - page 46 / 214 » Factorization as a Rank 1 Problem |
169
click to vote
IPCO
1993
15 years 7 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
168
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
179
click to vote
ICB
2009
Springer
15 years 3 months ago
2009
Springer
Many large-scale biometric systems operate in the identification mode and include multimodal information. While biometric fusion is a well-studied problem, most of the fusion schem...
153
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
174
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...