Sciweavers

6568 search results - page 1181 / 1314
» Reducing the Complexity of Reductions
Sort
View
SIGSOFT
2000
ACM
15 years 10 months ago
Implicit context: easing software evolution and reuse
Software systems should consist of simple, conceptually clean software components interacting along narrow, well-defined paths. All too often, this is not reality: complex compon...
Robert J. Walker, Gail C. Murphy
INFOCOM
1999
IEEE
15 years 10 months ago
Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
Isabella Chang, Robert Engel, Dilip D. Kandlur, Di...
SIGCOMM
1998
ACM
15 years 10 months ago
Quality of Service Based Routing: A Performance Perspective
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
George Apostolopoulos, Roch Guérin, Sanjay ...
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 10 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 10 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
« Prev « First page 1181 / 1314 Last » Next »