Sciweavers

1171 search results - page 46 / 235
» Multisource Algorithmic Information Theory
Sort
View
CCS
2011
ACM
13 years 9 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...
CORR
2008
Springer
157views Education» more  CORR 2008»
14 years 10 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
FOCS
2000
IEEE
15 years 2 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
15 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
15 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth