Sciweavers

494 search results - page 17 / 99
» Heap Building Bounds
Sort
View
121
Voted
SPAA
2009
ACM
15 years 8 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
128
Voted
LCTRTS
1998
Springer
15 years 8 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
115
Voted
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
15 years 10 months ago
Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
Stephen Kloder, Seth Hutchinson
129
Voted
EUROCRYPT
2001
Springer
15 years 8 months ago
Lower Bounds for Multicast Message Authentication
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
Dan Boneh, Glenn Durfee, Matthew K. Franklin
166
Voted
ONDM
2001
15 years 5 months ago
Traffic Load Bounds for Optical Burst-Switched Networks with Dynamic Wavelength Allocation
: The maximum traffic load that can be supported by a wavelength division multiplexed (WDM) optical burst switched (OBS) network with dynamic wavelength allocation is studied. It i...
Ignacio de Miguel, Michael Düser, Polina Bayv...