Sciweavers

565 search results - page 25 / 113
» Geometry of Upper Probabilities
Sort
View
DSSCV
2005
Springer
15 years 5 months ago
Deep Structure of Images in Populations Via Geometric Models in Populations
We face the question of how to produce a scale space of image intensities relative to a scale space of objects or other characteristic image regions filling up the image space, whe...
Stephen M. Pizer, Ja-Yeon Jeong, Robert E. Broadhu...
GFKL
2007
Springer
137views Data Mining» more  GFKL 2007»
15 years 3 months ago
Families of Dendrograms
A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the m...
Patrick Erik Bradley
DGCI
2008
Springer
15 years 1 months ago
Gift-Wrapping Based Preimage Computation Algorithm
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
Yan Gérard, Fabien Feschet, David Coeurjoll...
CORR
2006
Springer
141views Education» more  CORR 2006»
14 years 11 months ago
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
Chun-Hao Hsu, Achilleas Anastasopoulos
GECCO
2004
Springer
15 years 5 months ago
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
Andreas Alexander Albrecht