995 search results - page 51 / 199 » complexity 2011 |
115
Voted
IACR
2011
14 years 2 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
199
Voted
SIGSOFT
2011
ACM
14 years 9 months ago
2011
ACM
Developing complex distributed systems is a non-trivial task. It is even more difficult when the systems need to dynamically reconfigure the distributed functionalities or tasks...
124
Voted
COMGEO
2011
ACM
14 years 9 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
116
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
111
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...