Sciweavers

1351 search results - page 125 / 271
» Trust in Anonymity Networks
Sort
View
IJON
2007
93views more  IJON 2007»
13 years 10 months ago
How much can we trust neural simulation strategies?
Despite a steady improvement of computational hardware, results of numerical simulation are still tightly bound to the simulation tool and strategy used, and may substantially var...
Michelle Rudolph, Alain Destexhe
EWCBR
2008
Springer
13 years 12 months ago
Provenance, Trust, and Sharing in Peer-to-Peer Case-Based Web Search
Despite the success of modern Web search engines, challenges remain when it comes to providing people with access to the right information at the right time. In this paper, we desc...
Peter Briggs, Barry Smyth
PET
2009
Springer
14 years 4 months ago
Physical Layer Attacks on Unlinkability in Wireless LANs
Abstract. Recent work has focused on hiding explicit network identifiers such as hardware addresses from the link layer to enable anonymous communications in wireless LANs. These ...
Kevin S. Bauer, Damon McCoy, Ben Greenstein, Dirk ...
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 11 months ago
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
Olivier Bournez, Jérémie Chalopin, J...
CORR
2011
Springer
164views Education» more  CORR 2011»
13 years 1 months ago
Lipschitz Games
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
Yaron Azrieli, Eran Shmaya