2434 search results - page 349 / 487 » Algorithmic Randomness of Closed Sets |
116
Voted
NOSSDAV
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we propose a simple and fully distributed mechanism for constructing and maintaining the overlay topology in mesh-based P2P-TV systems. Our algorithm optimizes the ...
118
Voted
MM
2005
ACM
15 years 9 months ago
2005
ACM
Labeling faces in news video with their names is an interesting research problem which was previously solved using supervised methods that demand significant user efforts on lab...
123
Voted
SSD
2005
Springer
15 years 9 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
131
Voted
STOC
1999
ACM
15 years 7 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
174
click to vote
CAV
1994
Springer
15 years 7 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...