Sciweavers

387 search results - page 24 / 78
» Many Random Walks Are Faster Than One
Sort
View
PVLDB
2010
103views more  PVLDB 2010»
13 years 7 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
ICIP
2001
IEEE
14 years 10 months ago
EM algorithms of Gaussian mixture model and hidden Markov model
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
Guorong Xuan, Wei Zhang, Peiqi Chai
PCI
2005
Springer
14 years 2 months ago
Gossip-Based Greedy Gaussian Mixture Learning
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowa...
VMV
2008
165views Visualization» more  VMV 2008»
13 years 10 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
14 years 1 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang