Sciweavers

1359 search results - page 6 / 272
» Black-Box Program Specialization
Sort
View
WSS
2001
111views Control Systems» more  WSS 2001»
13 years 8 months ago
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
13 years 7 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti
SIGIR
1996
ACM
13 years 11 months ago
Retrieval of Complex Objects Using a Four-Valued Logic
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
Thomas Rölleke, Norbert Fuhr
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 8 months ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson
SAC
2008
ACM
13 years 7 months ago
Automatic software fault localization using generic program invariants
Despite extensive testing in the development phase, residual defects can be a great threat to dependability in the operational phase. This paper studies the utility of lowcost, ge...
Rui Abreu, Alberto González 0002, Peter Zoe...