Sciweavers

834 search results - page 137 / 167
» Quantifying and Measuring Anonymity
Sort
View
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc
HICSS
2003
IEEE
186views Biometrics» more  HICSS 2003»
14 years 3 months ago
Personalization through Mask Marketing
Customized marketing, so called 1-to-1 marketing, is often viewed as the panacea of e-commerce. User profiles, such as click streams logging every site the user accesses, are expl...
Moritz Strasser, Alf Zugenmaier
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
SIROCCO
2008
13 years 11 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
TIFS
2008
129views more  TIFS 2008»
13 years 9 months ago
On Empirical Recognition Capacity of Biometric Systems Under Global PCA and ICA Encoding
Performance of biometric-based recognition systems depends on various factors: database quality, image preprocessing, encoding techniques, etc. Given a biometric database and a se...
Natalia A. Schmid, Francesco Nicolo