Sciweavers

1068 search results - page 207 / 214
» Extremely randomized trees
Sort
View
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 2 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ICPR
2008
IEEE
14 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
BIBM
2007
IEEE
132views Bioinformatics» more  BIBM 2007»
14 years 1 months ago
A Divide-and-Conquer Implementation of Three Sequence Alignment and Ancestor Inference
In this paper, we present an algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. Our algorithm can be fu...
Feng Yue, Jijun Tang
CLEAR
2007
Springer
166views Biometrics» more  CLEAR 2007»
14 years 1 months ago
The IBM Rich Transcription 2007 Speech-to-Text Systems for Lecture Meetings
The paper describes the IBM systems submitted to the NIST Rich Transcription 2007 (RT07) evaluation campaign for the speechto-text (STT) and speaker-attributed speech-to-text (SAST...
Jing Huang, Etienne Marcheret, Karthik Visweswaria...