74 search results - page 15 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
MOBICOM
2004
ACM
13 years 10 months ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
ECCV
2004
Springer
14 years 6 months ago
2004
Springer
Recovery of three dimensional (3D) shape and motion of non-static scenes from a monocular video sequence is important for applications like robot navigation and human computer inte...
MOBISYS
2006
ACM
14 years 4 months ago
2006
ACM
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, ...