Sciweavers

2814 search results - page 329 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 11 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
SYNASC
2007
IEEE
136views Algorithms» more  SYNASC 2007»
14 years 5 months ago
Wikipedia-Based Kernels for Text Categorization
In recent years several models have been proposed for text categorization. Within this, one of the widely applied models is the vector space model (VSM), where independence betwee...
Zsolt Minier, Zalan Bodo, Lehel Csató
ISTCS
1997
Springer
14 years 2 months ago
Learning with Queries Corrupted by Classification Noise
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
SPAA
2006
ACM
14 years 4 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 5 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett