535 search results - page 50 / 107 » Checking Computations in Polylogarithmic Time |
IPSN
2009
Springer
14 years 3 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
ASPLOS
2011
ACM
13 years 18 days ago
2011
ACM
Transiently powered computing devices such as RFID tags, kinetic energy harvesters, and smart cards typically rely on programs that complete a task under tight time constraints be...
IANDC
2007
13 years 9 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
This paper presents our work on automatically detecting moving rigid text in digital videos. The temporal information is obtained by dividing a video frame into sub-blocks and cal...