Sciweavers

3136 search results - page 480 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CORR
2004
Springer
110views Education» more  CORR 2004»
15 years 6 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi
CAGD
2000
62views more  CAGD 2000»
15 years 6 months ago
Volume morphing and rendering - An integrated approach
In this paper, we first introduce a 3D morphing method for landmark-based volume deformation, using various scattered data interpolation schemes. Qualitative and speed comparisons...
Shiaofen Fang, Rajagopalan Srinivasan, Raghu Ragha...
ICCV
2009
IEEE
16 years 11 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
ICCV
2007
IEEE
16 years 8 months ago
Spherical-Homoscedastic Shapes
Shape analysis requires invariance under translation, scale and rotation. Translation and scale invariance can be realized by normalizing shape vectors with respect to their mean ...
Onur C. Hamsici, Aleix M. Martínez
ICCV
2001
IEEE
16 years 8 months ago
Image Segmentation by Data Driven Markov Chain Monte Carlo
?This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contribut...
Zhuowen Tu, Song Chun Zhu, Heung-Yeung Shum