Sciweavers

7195 search results - page 488 / 1439
» On Computing Power
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 7 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
16 years 7 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
PERCOM
2008
ACM
16 years 6 months ago
Are our homes ready for services? A domotic infrastructure based on the Web service stack
The increase in computational power and the networking abilities of home appliances are revolutionizing the way we interact with our homes. This trend is growing stronger and open...
Marco Aiello, Schahram Dustdar
ICPR
2006
IEEE
16 years 1 months ago
Tensor Voting Accelerated by Graphics Processing Units (GPU)
This paper presents a new GPU-based tensor voting implementation which achieves significant performance improvement over the conventional CPU-based implementation. Although the t...
Changki Min, Gérard G. Medioni
ETRICS
2006
15 years 10 months ago
Visual Document Authentication Using Human-Recognizable Watermarks
Digital signatures and message authentication codes are well known methods for ensuring message integrity. However, they rely on computations which are too hard to be performed by ...
Igor Fischer, Thorsten Herfet