Sciweavers

1517 search results - page 208 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
ICPP
2002
IEEE
15 years 9 months ago
Out-of-Order Instruction Fetch Using Multiple Sequencers
Conventional instruction fetch mechanisms fetch contiguous blocks of instructions in each cycle. They are difficult to scale since taken branches make it hard to increase the siz...
Paramjit S. Oberoi, Gurindar S. Sohi
ICPPW
2002
IEEE
15 years 9 months ago
A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
In large networks, maintaining precise global network state information is almost impossible. Many factors, such as non-negligible propagation delay, infrequent state updates due ...
Jun Zhou, Xin Yuan
ICCV
2001
IEEE
16 years 5 months ago
BRDF/BTF Measurement Device
Capturing surface appearance is important for a large number of applications. Appearance of real world surfaces is dif?cult to model as it varies with the direction of illuminatio...
Kristin J. Dana
IPPS
2006
IEEE
15 years 10 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
MOBICOM
2012
ACM
13 years 6 months ago
Argos: practical many-antenna base stations
Multi-user multiple-input multiple-output theory predicts manyfold capacity gains by leveraging many antennas on wireless base stations to serve multiple clients simultaneously th...
Clayton Shepard, Hang Yu, Narendra Anand, Erran Li...