3244 search results - page 410 / 649 » On convex complexity measures |
241
click to vote
AAAI
2011
14 years 6 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
231
click to vote
JMLR
2012
13 years 9 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
189
click to vote
APPROX
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
168
click to vote
IEEEPACT
2006
IEEE
16 years 19 days ago
2006
IEEE
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
174
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense tha...