Sciweavers

2080 search results - page 188 / 416
» Measuring empirical computational complexity
Sort
View
VLSM
2005
Springer
15 years 10 months ago
Advances in Variational Image Segmentation Using AM-FM Models: Regularized Demodulation and Probabilistic Cue Integration
Current state-of-the-art methods in variational image segmentation using level set methods are able to robustly segment complex textured images in an unsupervised manner. In recent...
Georgios Evangelopoulos, Iasonas Kokkinos, Petros ...
AGP
2003
IEEE
15 years 10 months ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal
148
Voted
DGCI
2008
Springer
15 years 6 months ago
Segmenting Simplified Surface Skeletons
A novel method for segmenting simplified skeletons of 3D shapes is presented. The so-called simplified Y-network is computed, defining boundaries between 2D sheets of the simplifie...
Dennie Reniers, Alexandru Telea
PERCOM
2010
ACM
15 years 3 months ago
Faster Bayesian context inference by using dynamic value ranges
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...
POPL
2012
ACM
14 years 15 days ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi