Sciweavers

1449 search results - page 88 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
WSCG
2003
136views more  WSCG 2003»
15 years 7 months ago
Piecewise Circular Approximation of Spirals and Polar Polynomials
Spirals are surprisingly common in science, nature, physics, astronomy, flora and fauna, and the arts. In Cartesian coordinates they are typically transcendental functions, which ...
Francesca Taponecco, Marc Alexa
IJCAI
1997
15 years 7 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
UAI
2000
15 years 7 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
167
Voted
ICASSP
2010
IEEE
15 years 6 months ago
Hierarchical Gaussian Mixture Model
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
Vincent Garcia, Frank Nielsen, Richard Nock
TKDE
2008
128views more  TKDE 2008»
15 years 6 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...