Sciweavers

6393 search results - page 997 / 1279
» Randomized Algorithms on the Mesh
Sort
View
SPAA
2010
ACM
15 years 9 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
RECOMB
1999
Springer
15 years 9 months ago
Classifying proteins by family using the product of correlated p-values
An important goal in bioinformatics is determining the homology and function of proteins from their sequences. Pairwise sequence similarity algorithms are often employed for this ...
Timothy L. Bailey, William Noble Grundy
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
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 6 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...