Sciweavers

20294 search results - page 276 / 4059
» Algorithmic Information Theory
Sort
View
152
Voted
COCO
2003
Springer
87views Algorithms» more  COCO 2003»
15 years 12 months ago
Extracting the Mutual Information for a Triple of Binary Strings
Andrei E. Romashchenko
JASIS
2011
97views more  JASIS 2011»
14 years 9 months ago
Advances in Information Science
Jonathan Furner
AIRWEB
2007
Springer
16 years 26 days ago
Using Spam Farm to Boost PageRank
Nowadays web spamming has emerged to take the economic advantage of high search rankings and threatened the accuracy and fairness of those rankings. Understanding spamming techniq...
Ye Du, Yaoyun Shi, Xin Zhao
ACMSE
2010
ACM
15 years 4 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson