Sciweavers

916 search results - page 158 / 184
» Using redundancies to find errors
Sort
View
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
14 years 11 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
81
Voted
VMV
2008
120views Visualization» more  VMV 2008»
14 years 11 months ago
Thinning Mesh Animations
Three-dimensional animation sequences are often represented by a discrete set of compatible triangle meshes. In order to create the illusion of a smooth motion, a sequence usually...
Tim Winkler, Jens Drieseberg, Kai Hormann, Alexand...
71
Voted
EACL
2006
ACL Anthology
14 years 11 months ago
Automatic Segmentation of Multiparty Dialogue
In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue. We extend prior work in two ways. We first apply approaches...
Pei-yun Hsueh, Johanna D. Moore, Steve Renals
AAAI
1998
14 years 11 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
ISMB
1997
14 years 11 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey