Sciweavers

5153 search results - page 748 / 1031
» Introduction to Randomized Algorithms
Sort
View
COMPGEOM
1992
ACM
15 years 8 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
147
Voted
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 5 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 5 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
BMCBI
2008
139views more  BMCBI 2008»
15 years 4 months ago
Abbreviation definition identification based on automatic precision estimates
Background: The rapid growth of biomedical literature presents challenges for automatic text processing, and one of the challenges is abbreviation identification. The presence of ...
Sunghwan Sohn, Donald C. Comeau, Won Kim, W. John ...
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 4 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...