UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Persistence-Based Clustering in Riemannian Manifolds

Journal of the ACM, 2013-11, Vol.60 (6), p.1-38

2013

Volltextzugriff (PDF)

Clustering under Approximation Stability

Journal of the ACM, 2013-04, Vol.60 (2), p.1-34

2013

Volltextzugriff (PDF)

A Discriminative Model for Semi-Supervised Learning

Journal of the ACM, 2010-03, Vol.57 (3), p.1-46

2010

Volltextzugriff (PDF)

Efficient and secure authenticated key exchange using weak passwords

Journal of the ACM, 2009-11, Vol.57 (1), p.1-39

2009

Volltextzugriff (PDF)

Efficient noise-tolerant learning from statistical queries

Journal of the ACM, 1998-11, Vol.45 (6), p.983-1006

Kearns, Michael

1998

Volltextzugriff (PDF)

Tabled evaluation with delaying for general logic programs

Journal of the ACM, 1996, Vol.43 (1), p.20-74

1996

Volltextzugriff (PDF)

Closure properties of constraints

Journal of the ACM, 1997-07, Vol.44 (4), p.527-548

1997

Volltextzugriff (PDF)

Lower bounds for linear degeneracy testing

Journal of the ACM, 2005-03, Vol.52 (2), p.157-171

2005

Volltextzugriff (PDF)

A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM, 1995-01, Vol.42 (1), p.67-90

1995

Volltextzugriff (PDF)

On the composition of authenticated byzantine agreement

Journal of the ACM, 2006-11, Vol.53 (6), p.881-917

2006

Volltextzugriff (PDF)

A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM, 1995-03, Vol.42 (2), p.321-328

1995

Volltextzugriff (PDF)

Scale-sensitive dimensions, uniform convergence, and learnability

Journal of the ACM, 1997-07, Vol.44 (4), p.615-631

1997

Volltextzugriff (PDF)

Constructing deterministic finite-state automata in recurrent neural networks

Journal of the ACM, 1996-11, Vol.43 (6), p.937-972

1996

Volltextzugriff (PDF)

On the Fourier spectrum of monotone functions

Journal of the ACM, 1996-07, Vol.43 (4), p.747-770

1996

Volltextzugriff (PDF)

The complexity of logic-based abduction

Journal of the ACM, 1995-01, Vol.42 (1), p.3-42

1995

Volltextzugriff (PDF)

Knowledge compilation and theory approximation

Journal of the ACM, 1996-03, Vol.43 (2), p.193-224

1996

Volltextzugriff (PDF)

Reasoning about knowledge and probability

Journal of the ACM, 1994-03, Vol.41 (2), p.340-367

1994

Volltextzugriff (PDF)

Predicting Lexical Answer Types in Open Domain QA

International journal on semantic web and information systems, 2012-07, Vol.8 (3), p.74-88

2012

Volltextzugriff (PDF)

Algebraic methods for interactive proof systems

Journal of the ACM, 1992-10, Vol.39 (4), p.859-868

1992

Volltextzugriff (PDF)

Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM, 1989-10, Vol.36 (4), p.929-965

1989

Volltextzugriff (PDF)

Mixed integer programming methods for computing nonmonotonic deductive databases

Journal of the ACM, 1994-11, Vol.41 (6), p.1178-1215

1994

Volltextzugriff (PDF)

A general approach to connected-component labeling for arbitrary image representations

Journal of the ACM, 1992-04, Vol.39 (2), p.253-280

1992

Volltextzugriff (PDF)

Fast text searching for regular expressions or automaton searching on tries

Journal of the ACM, 1996-11, Vol.43 (6), p.915-936

1996

Volltextzugriff (PDF)

On the minimality and global consistency of row-convex constraint networks

Journal of the ACM, 1995-05, Vol.42 (3), p.543-561

1995

Volltextzugriff (PDF)

A propositional modal logic of time intervals

Journal of the ACM, 1991-10, Vol.38 (4), p.935-962

1991

Volltextzugriff (PDF)

1 – 25 von 1.062

Menü

Weitere Dienste

Einstellungen

Persistence-Based Clustering in Riemannian Manifolds

Clustering under Approximation Stability

A Discriminative Model for Semi-Supervised Learning

Efficient and secure authenticated key exchange using weak passwords

Efficient noise-tolerant learning from statistical queries

Tabled evaluation with delaying for general logic programs

Closure properties of constraints

Lower bounds for linear degeneracy testing

A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

On the composition of authenticated byzantine agreement

A randomized linear-time algorithm to find minimum spanning trees

Scale-sensitive dimensions, uniform convergence, and learnability

Constructing deterministic finite-state automata in recurrent neural networks

On the Fourier spectrum of monotone functions

The complexity of logic-based abduction

Knowledge compilation and theory approximation

Reasoning about knowledge and probability

Predicting Lexical Answer Types in Open Domain QA

Algebraic methods for interactive proof systems

Learnability and the Vapnik-Chervonenkis dimension

Mixed integer programming methods for computing nonmonotonic deductive databases

A general approach to connected-component labeling for arbitrary image representations

Fast text searching for regular expressions or automaton searching on tries

On the minimality and global consistency of row-convex constraint networks

A propositional modal logic of time intervals

Aktive Filter

Suchergebnisse filtern