Sciweavers

238 search results - page 28 / 48
» Parallel Algorithm for Maximum Weight Matching in Trees
Sort
View
SIAMIS
2011
14 years 4 months ago
Locally Parallel Texture Modeling
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
Pierre Maurel, Jean-François Aujol, Gabriel...
CORR
2007
Springer
140views Education» more  CORR 2007»
14 years 9 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock
PARA
2000
Springer
15 years 1 months ago
Parallel and Distributed Document Overlap Detection on the Web
Proliferation of digital libraries plus availability of electronic documents from the Internet have created new challenges for computer science researchers and professionals. Docum...
Krisztián Monostori, Arkady B. Zaslavsky, H...
ECSQARU
2009
Springer
15 years 4 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
TALG
2008
81views more  TALG 2008»
14 years 9 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...