Sciweavers

2403 search results - page 470 / 481
» Optimal Randomized RANSAC
Sort
View
IEICET
2006
108views more  IEICET 2006»
14 years 9 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
CN
2007
117views more  CN 2007»
14 years 9 months ago
Cellular universal IP for nested network mobility
In recent years, network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO basic support protocol (NBSP), ...
Patrick P. Lam, Soung C. Liew, Jack Y. B. Lee
JAIR
2008
157views more  JAIR 2008»
14 years 9 months ago
Learning to Reach Agreement in a Continuous Ultimatum Game
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...
Steven de Jong, Simon Uyttendaele, Karl Tuyls
CORR
2007
Springer
91views Education» more  CORR 2007»
14 years 9 months ago
Unequal dimensional small balls and quantization on Grassmann Manifolds
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
Wei Dai, Brian Rider, Youjian Liu
CORR
2007
Springer
124views Education» more  CORR 2007»
14 years 9 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...