Sciweavers

4355 search results - page 31 / 871
» Increasing Kolmogorov Complexity
Sort
View
JCST
2010
147views more  JCST 2010»
13 years 7 months ago
A New Approach for Multi-Document Update Summarization
Fast changing knowledge on the Internet can be acquired more efficiently with the help of automatic document summarization and updating techniques. This paper describes a novel app...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 9 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
14 years 9 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
ALT
2007
Springer
14 years 2 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud