Sciweavers

8298 search results - page 1294 / 1660
» On the Complexity of Numerical Analysis
Sort
View
PODC
2009
ACM
16 years 7 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
PODC
2009
ACM
16 years 7 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
16 years 7 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 7 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 7 months ago
Generative model-based clustering of directional data
High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multivaria...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
« Prev « First page 1294 / 1660 Last » Next »