Sciweavers

9842 search results - page 1871 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CADE
2005
Springer
14 years 10 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 10 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 10 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 10 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
14 years 10 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
« Prev « First page 1871 / 1969 Last » Next »