Sciweavers

427 search results - page 73 / 86
» Computing the Local Consensus of Trees
Sort
View
107
Voted
IPPS
2000
IEEE
15 years 3 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 11 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
PAMI
2008
179views more  PAMI 2008»
14 years 11 months ago
Modeling, Clustering, and Segmenting Video with Mixtures of Dynamic Textures
A dynamic texture is a spatio-temporal generative model for video, which represents video sequences as observations from a linear dynamical system. This work introduces the mixtur...
Antoni B. Chan, Nuno Vasconcelos
TCSV
2008
150views more  TCSV 2008»
14 years 11 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
CGA
2005
14 years 11 months ago
Bounded Blending for Function-Based Shape Modeling
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
Galina Pasko, Alexander A. Pasko, Tosiyasu L. Kuni...