Sciweavers

64 search results - page 11 / 13
» A New Quartet Tree Heuristic for Hierarchical Clustering
Sort
View
ICTAI
2010
IEEE
13 years 4 months ago
Unsupervised Greedy Learning of Finite Mixture Models
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
Nicola Greggio, Alexandre Bernardino, Cecilia Lasc...
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
PG
1999
IEEE
13 years 11 months ago
Automatic Creation of Object Hierarchies for Radiosity Clustering
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...
Gordon Müller, Stephan Schäfer, Dieter W...
CVDB
2004
ACM
14 years 29 days ago
The PIBE Personalizable Image Browsing Engine
In this paper we describe PIBE, a new Personalizable Image Browsing Engine that allows an effective visual exploration of large image collections combining computer vision and da...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
14 years 4 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...