Sciweavers

5793 search results - page 929 / 1159
» Individual communication complexity
Sort
View
104
Voted
SIGSOFT
2000
ACM
15 years 5 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
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 5 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
90
Voted
MICRO
1999
IEEE
98views Hardware» more  MICRO 1999»
15 years 5 months ago
Access Region Locality for High-Bandwidth Processor Memory System Design
This paper studies an interesting yet less explored behavior of memory access instructions, called access region locality. Unlike the traditional temporal and spatial data localit...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
FCCM
1998
IEEE
107views VLSI» more  FCCM 1998»
15 years 5 months ago
Frequency-Domain Sonar Processing in FPGAs and DSPs
Over the past year we have been exploring the use of FPGA-based custom computing machines for several sonar beamforming applications, including time-domain beamforming[1], frequen...
Paul Graham, Brent E. Nelson
KES
1999
Springer
15 years 5 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli