Sciweavers

11580 search results - page 2274 / 2316
» Communication vs. Computation
Sort
View
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
13 years 11 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
CCS
2007
ACM
13 years 11 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
ECRIME
2007
13 years 11 months ago
Evaluating a trial deployment of password re-use for phishing prevention
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
Dinei A. F. Florêncio, Cormac Herley
ELPUB
2007
ACM
13 years 11 months ago
Towards an Ontology of ElPub/SciX: A Proposal
A proposal is presented for a standard ontology language defined as ElPub/SciX Ontology, based on the content of a web digital library of conference proceedings. This content, i.e...
Sely Maria de Souza Costa, Cláudio Gottscha...
EMNETS
2007
13 years 11 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son
« Prev « First page 2274 / 2316 Last » Next »