Sciweavers

676 search results - page 119 / 136
» Sub-stochastic matrix analysis for bounds computation - Theo...
Sort
View
COLT
2001
Springer
13 years 12 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
MOBICOM
2004
ACM
14 years 24 days ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
SIAMSC
2008
168views more  SIAMSC 2008»
13 years 7 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 1 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello