Sciweavers

1887 search results - page 211 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
SDM
2007
SIAM
112views Data Mining» more  SDM 2007»
13 years 10 months ago
PoClustering: Lossless Clustering of Dissimilarity Data
Given a set of objects V with a dissimilarity measure between pairs of objects in V , a PoCluster is a collection of sets P ⊂ powerset(V ) partially ordered by the ⊂ relation ...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
CEC
2010
IEEE
13 years 10 months ago
An analysis of massively distributed evolutionary algorithms
Computational science is placing new demands on optimization algorithms as the size of data sets and the computational complexity of scientific models continue to increase. As thes...
Travis J. Desell, David P. Anderson, Malik Magdon-...
BMCBI
2005
126views more  BMCBI 2005»
13 years 9 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois
CIKM
2008
Springer
13 years 11 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...