Sciweavers

7318 search results - page 1356 / 1464
» Models of real-valued measurability
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
GIS
2007
ACM
15 years 10 months ago
Randomization in traffic information sharing systems
In this paper, we consider a traffic information sharing system based on Floating Car Data (FCD). FCD is one of the methods used to gather traffic information; it uses vehicles as...
Masaaki Tanizaki, Ouri Wolfson
APGV
2006
ACM
144views Visualization» more  APGV 2006»
15 years 10 months ago
Efficient selective rendering of participating media
Realistic image synthesis is the process of computing photorealistic images which are perceptually and measurably indistinguishable from real-world images. In order to obtain high...
Oscar Anson, Veronica Sundstedt, Diego Gutierrez, ...
CCS
2006
ACM
15 years 10 months ago
Design space and analysis of worm defense strategies
We give the first systematic investigation of the design space of worm defense system strategies. We accomplish this by g a taxonomy of defense strategies by abstracting away impl...
David Brumley, Li-Hao Liu, Pongsin Poosankam, Dawn...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
« Prev « First page 1356 / 1464 Last » Next »