Sciweavers

8025 search results - page 1029 / 1605
» Combinators Introduction: An Algorithm
Sort
View
INFOCOM
1997
IEEE
15 years 11 months ago
Collision Avoidance and Resolution Multiple Access with Transmission Groups
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
Rodrigo Garcés, J. J. Garcia-Luna-Aceves
CVPR
1996
IEEE
15 years 11 months ago
Pattern Rejection
The e ciency of pattern recognition is particularly crucial in two scenarios; whenever there are a large number of classes to discriminate, and, whenever recognition must be perfo...
Simon Baker, Shree K. Nayar
SIGSOFT
1994
ACM
15 years 11 months ago
Data Flow Analysis for Verifying Properties of Concurrent Programs
In this paper we present an approach, based on data ow analysis, that can provide cost-e ective analysis of concurrent programs with respect to explicitly stated correctness prope...
Matthew B. Dwyer, Lori A. Clarke
148
Voted
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 11 months ago
Memory-Contention Responsive Hash Joins
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
Diane L. Davison, Goetz Graefe
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 11 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
« Prev « First page 1029 / 1605 Last » Next »