Sciweavers

20831 search results - page 4078 / 4167
» Quantum Computation and Information
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 2 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
EVOW
2007
Springer
14 years 1 months ago
Scale Invariance for Evolved Interest Operators
Abstract. This work presents scale invariant region detectors that apply evolved operators to extract an interest measure. We evaluate operators using their repeatability rate, and...
Leonardo Trujillo, Gustavo Olague
SOUPS
2010
ACM
14 years 1 months ago
A closer look at recognition-based graphical passwords on mobile devices
Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs. However, despite being bas...
Paul Dunphy, Andreas P. Heiner, N. Asokan
GLVLSI
2009
IEEE
170views VLSI» more  GLVLSI 2009»
14 years 1 months ago
Physical unclonable function and true random number generator: a compact and scalable implementation
Physical Unclonable Functions (PUF) and True Random Number Generators (TRNG) are two very useful components in secure system design. PUFs can be used to extract chip-unique signat...
Abhranil Maiti, Raghunandan Nagesh, Anand Reddy, P...
COMPSAC
2004
IEEE
14 years 1 months ago
Testing Context-Sensitive Middleware-Based Software Applications
Context-sensitive middleware-based software is an emerging kind of ubiquitous computing application. The components of such software communicate proactively among themselves accor...
T. H. Tse, Stephen S. Yau, W. K. Chan, Heng Lu, Ts...
« Prev « First page 4078 / 4167 Last » Next »