9997 search results - page 1851 / 2000 » The case for crowd computing |
141
Voted
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
131
Voted
ATVA
2009
Springer
15 years 12 months ago
2009
Springer
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
138
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
194
click to vote
MOBICOM
2004
ACM
15 years 10 months ago
2004
ACM
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
186
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...