Sciweavers

2814 search results - page 32 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ICML
2006
IEEE
14 years 10 months ago
Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
Charles Elkan
NIPS
2004
13 years 11 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
ALGORITHMICA
2011
13 years 1 months ago
Average Rate Speed Scaling
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operati...
Nikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 4 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
JMLR
2011
93views more  JMLR 2011»
13 years 4 months ago
Time Series Analysis with the Causality Workbench
The Causality Workbench project is an environment to test causal discovery algorithms. Via a web portal (http://clopinet.com/causality), it provides a number of resources, includi...
Isabelle Guyon, Alexander Satnikov, Constantin F. ...