Sciweavers

272 search results - page 45 / 55
» Lazy tree splitting
Sort
View
HIS
2008
13 years 9 months ago
REPMAC: A New Hybrid Approach to Highly Imbalanced Classification Problems
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
Hernán Ahumada, Guillermo L. Grinblat, Luca...
ACL
2006
13 years 9 months ago
PCFGs with Syntactic and Prosodic Indicators of Speech Repairs
A grammatical method of combining two kinds of speech repair cues is presented. One cue, prosodic disjuncture, is detected by a decision tree-based ensemble classifier that uses a...
John Hale, Izhak Shafran, Lisa Yung, Bonnie J. Dor...
SEBD
1997
158views Database» more  SEBD 1997»
13 years 9 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
JPDC
2008
92views more  JPDC 2008»
13 years 7 months ago
Techniques for pipelined broadcast on ethernet switched clusters
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In thi...
Pitch Patarasuk, Xin Yuan, Ahmad Faraj
RECOMB
2010
Springer
13 years 6 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...