3475 search results - page 74 / 695 » Backbones in Optimization and Approximation |
128
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
107
click to vote
BC
2006
15 years 2 months ago
2006
The part of the primate visual cortex responsible for the recognition of objects is parcelled into about a dozen areas organized somewhat hierarchically (the region is called the v...
143
Voted
SODA
2010
ACM
15 years 26 days ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
124
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
133
click to vote
KR
1992
Springer
15 years 6 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...