Sciweavers

1082 search results - page 179 / 217
» Approximation Algorithms for Spreading Points
Sort
View
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
14 years 9 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 3 months ago
Piercing Translates and Homothets of a Convex Body
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
Adrian Dumitrescu, Minghui Jiang
IAT
2008
IEEE
14 years 3 months ago
Introducing Communication in Dis-POMDPs with Locality of Interaction
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...
Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Y...
MMSP
2008
IEEE
216views Multimedia» more  MMSP 2008»
14 years 3 months ago
Using stochastic gradient-descent scheme in appearance model based face tracking
— Active appearance model (AAM) has been widely used in face tracking and recognition. However, accuracy and efficiency are always two main challenges with the AAM search. The pa...
Zhidong Li, Jing Chen, Adrian Chong, Zhenghua Yu, ...
FSTTCS
2007
Springer
14 years 2 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe