Sciweavers

1541 search results - page 254 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 9 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...
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
13 years 7 months ago
On Bayes Methods for On-Line Boolean Prediction
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
PVLDB
2008
144views more  PVLDB 2008»
13 years 7 months ago
Mining search engine query logs via suggestion sampling
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
Ziv Bar-Yossef, Maxim Gurevich
CORR
2011
Springer
177views Education» more  CORR 2011»
12 years 12 months ago
Gossip PCA
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
Satish Babu Korada, Andrea Montanari, Sewoong Oh
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith