Sciweavers

9997 search results - page 1608 / 2000
» The case for crowd computing
Sort
View
IDA
2010
Springer
15 years 8 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
COCOON
2008
Springer
15 years 8 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu
201
Voted
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
176
Voted
ETS
2007
IEEE
128views Hardware» more  ETS 2007»
15 years 8 months ago
Selecting Power-Optimal SBST Routines for On-Line Processor Testing
Software-Based Self-Test (SBST) has emerged as an effective strategy for on-line testing of processors integrated in non-safety critical embedded system applications. Among the mo...
Andreas Merentitis, Nektarios Kranitis, Antonis M....
223
Voted
CSL
2008
Springer
15 years 8 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak
« Prev « First page 1608 / 2000 Last » Next »