Sciweavers

1668 search results - page 101 / 334
» Two Philosophical Applications of Algorithmic Information Th...
Sort
View
CADE
2001
Springer
16 years 4 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
FOCS
1999
IEEE
15 years 8 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
SIAMNUM
2010
123views more  SIAMNUM 2010»
14 years 11 months ago
Critical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
Pawel Dlotko, Ruben Specogna
MM
2006
ACM
181views Multimedia» more  MM 2006»
15 years 10 months ago
Peer-to-peer multimedia applications
In both academia and industry, peer-to-peer (P2P) applications have attracted great attention. Peer-to-peer file sharing applications, such as Napster, Gnutella, Kazaa, BitTorrent...
Jin Li
SIGIR
2009
ACM
15 years 11 months ago
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
Jimmy J. Lin