Sciweavers

16430 search results - page 461 / 3286
» On Computable Tree Functions
Sort
View
UC
2009
Springer
16 years 1 months ago
Abstract Geometrical Computation and Computable Analysis
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...
Jérôme Durand-Lose
ICIP
2006
IEEE
16 years 8 months ago
Region Based Segmentation Using the Tree of Shapes
The tree of shapes is a powerful tool for image representation which holds many interesting properties. There are many works in the literature that use it for image segmentation, ...
Gregory Randall, Juan Cardelino, Marcelo Bertalm&i...
DAC
2008
ACM
16 years 8 months ago
Robust chip-level clock tree synthesis for SOC designs
A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to differ...
Anand Rajaram, David Z. Pan
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 7 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
ECSQARU
2009
Springer
16 years 1 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...