Sciweavers

2988 search results - page 226 / 598
» Experiments with a New Boosting Algorithm
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
15 years 9 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
CCGRID
2002
IEEE
15 years 9 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
GBRPR
2009
Springer
15 years 9 months ago
A Recursive Embedding Approach to Median Graph Computation
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
AIMSA
2000
Springer
15 years 8 months ago
Steps towards C+C: A Language for Interactions
We present in this paper our reflections about the requirements of new architectures and languages for the Web, confronted with the ones emerging from qualified scientists such as ...
Stefano A. Cerri, Jean Sallantin, Emmanuel Castro,...
APBC
2003
15 years 5 months ago
Microarray Image Processing Based on Clustering and Morphological Analysis
Microarrays allow the monitoring of expressions for tens of thousands of genes simultaneously. Image analysis is an important aspect for microarray experiments that can affect sub...
Shuanhu Wu, Hong Yan