Sciweavers

7839 search results - page 1502 / 1568
» What's News, What's Not
Sort
View
TCS
2008
13 years 8 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
TCS
2008
13 years 8 months ago
Self-deployment of mobile sensors on a ring
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
IPL
2007
72views more  IPL 2007»
13 years 8 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
TCS
2008
13 years 8 months ago
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively o...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro...
TIFS
2008
154views more  TIFS 2008»
13 years 8 months ago
Data Fusion and Cost Minimization for Intrusion Detection
Abstract--Statistical pattern recognition techniques have recently been shown to provide a finer balance between misdetections and false alarms than the more conventional intrusion...
Devi Parikh, Tsuhan Chen
« Prev « First page 1502 / 1568 Last » Next »