Sciweavers

1414 search results - page 29 / 283
» Randomness and Universal Machines
Sort
View
PKC
1999
Springer
83views Cryptology» more  PKC 1999»
14 years 26 days ago
On the Security of Random Sources
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
Jean-Sébastien Coron
ALGOSENSORS
2007
Springer
14 years 2 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
CVPR
2009
IEEE
15 years 3 months ago
Increased Discrimination in Level Set Methods with Embedded Conditional Random Fields
We propose a novel approach for improving level set seg- mentation methods by embedding the potential functions from a discriminatively trained conditional random field (CRF) in...
Dana Cobzas (University of Alberta), Mark Schmidt ...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 9 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
FSS
2008
127views more  FSS 2008»
13 years 8 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...