Sciweavers

1618 search results - page 233 / 324
» Testing random number generators
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 7 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
JPDC
2008
129views more  JPDC 2008»
15 years 3 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
TPDS
2010
89views more  TPDS 2010»
15 years 1 months ago
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks
—Various sensor types, e.g., temperature, humidity, and acoustic, sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for th...
Mohamed Hefeeda, Hossein Ahmadi
ACSAC
2010
IEEE
15 years 1 months ago
Exploring usability effects of increasing security in click-based graphical passwords
Graphical passwords have been proposed to address known problems with traditional text passwords. For example, memorable user-chosen text passwords are predictable, but random sys...
Elizabeth Stobert, Alain Forget, Sonia Chiasson, P...
ICIP
2009
IEEE
15 years 25 days ago
Shapes as empirical distributions
We address the problem of shape based classification. We interpret the shape of an object as a probability distribution governing the location of the points of the object. An imag...
Bernardo Rodrigues Pires, José M. F. Moura