3341 search results - page 414 / 669 » On Bounded Queries and Approximation |
180
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
162
click to vote
NAACL
2010
15 years 4 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
174
click to vote
RSA
2010
15 years 1 months ago
2010
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
183
click to vote
TIT
2010
15 years 1 months ago
2010
Shortened cyclic codes that are capable of correcting up to a single burst of errors are considered. The efficiency of such codes has been analized by how well they approximate the...
269
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...