Sciweavers

303 search results - page 20 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
DC
2007
13 years 8 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
STOC
1995
ACM
126views Algorithms» more  STOC 1995»
14 years 19 hour ago
A computational view of population genetics
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 12 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
SIGCSE
2002
ACM
202views Education» more  SIGCSE 2002»
13 years 8 months ago
A tutorial program for propositional logic with human/computer interactive learning
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
Stacy Lukins, Alan Levicki, Jennifer Burg
JMLR
2010
119views more  JMLR 2010»
13 years 3 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto