Sciweavers

6142 search results - page 340 / 1229
» The Complexity of Partition Functions
Sort
View
JC
2007
101views more  JC 2007»
15 years 6 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
203
Voted
GFKL
2005
Springer
141views Data Mining» more  GFKL 2005»
16 years 6 days ago
On External Indices for Mixtures: Validating Mixtures of Genes
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
Ivan G. Costa, Alexander Schliep
CCGRID
2003
IEEE
15 years 12 months ago
RelayCast: A Middleware for Application-level Multicast Services
Application-level multicast (ALM) is being increasingly recognized as a solution to support multipoint applications without the need for a network layer multicast protocol. Though...
Nodoka Mimura, Kiyohide Nakauchi, Hiroyuki Morikaw...
ICIP
2005
IEEE
16 years 8 days ago
Graph cut based segmentation of convoluted objects
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
Alex Yong Sang Chia, Vitali Zagorodnov
ECCV
1992
Springer
16 years 8 months ago
Boundary Detection in Piecewise Homogeneous Textured Images
We address the problem of scale selection in texture analysis. Two di erent scale parameters, feature scale and statistical scale, are dened. Statistical scale is the size of the r...
Stefano Casadei, Sanjoy K. Mitter, Pietro Perona