Sciweavers

14084 search results - page 2647 / 2817
» A Theory for Game Theories
Sort
View
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
15 years 10 months ago
Empirical CATeam Research in Meetings
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
15 years 10 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
APN
1993
Springer
15 years 10 months ago
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitiv...
Søren Christensen, Niels Damgaard Hansen
COLT
1993
Springer
15 years 10 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
COLT
1993
Springer
15 years 10 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
« Prev « First page 2647 / 2817 Last » Next »