10392 search results - page 2055 / 2079 » Introduction to Computer Science |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
In this work we present a measurement study of user mobility in Second Life. We first discuss different techniques to collect user traces and then focus on results obtained using ...
CPHYSICS
2010
13 years 11 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
ECCC
2010
13 years 11 months ago
2010
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...