Sciweavers

102291 search results - page 19885 / 20459
» Computing
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ECRIME
2007
15 years 8 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
15 years 8 months ago
Technical Infrastructure and Policy Framework for Maximising the Benefits from Research Output
Electronic publishing is one part of a much larger process. There is a research lifecycle from creation of a programme for funded research through research proposals, projects, ou...
Keith G. Jeffery
ELPUB
2007
ACM
15 years 8 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
15 years 8 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 19885 / 20459 Last » Next »