1022 search results - page 14 / 205 » New models and algorithms for programmable networks |
147
click to vote
EGH
2003
Springer
15 years 7 months ago
2003
Springer
We capitalize on recent advances in modern programmable graphics hardware, originally designed to support advanced local illumination models for shading, to instead perform two di...
120
click to vote
ANSS
1991
IEEE
15 years 5 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
109
click to vote
TNN
1998
15 years 1 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
124
click to vote
BERTINORO
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...
63
Voted
CHI
2003
ACM
16 years 2 months ago
2003
ACM
Cameras provide an appealing new input medium for interaction. The creation of camera-based interfaces is outside the skill-set of most programmers and completely beyond the skill...