4843 search results - page 292 / 969 » The Shortcut Problem - Complexity and Approximation |
135
Voted
SIAMJO
2011
14 years 11 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
128
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The notion of the 1-D analytic signal is well understood and has found many applications. At the heart of the analytic signal concept is the Hilbert transform. The problem in exte...
280
click to vote
JMLR
2012
13 years 6 months ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
243
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
224
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...