3937 search results - page 150 / 788 » Questioning Ubiquitous Computing |
112
Voted
TCC
2007
Springer
15 years 8 months ago
2007
Springer
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
103
Voted
DEXAW
2004
IEEE
15 years 6 months ago
2004
IEEE
In distance learning for computer literacy, a student's skill is dependent on personal experience. In such cases, it is important to determine the student's understandin...
91
Voted
SIAMDM
2010
15 years 1 months ago
2010
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
101
click to vote
KES
1998
Springer
15 years 6 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
118
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...