2961 search results - page 452 / 593 » Optimization of tele-immersion codes |
153
click to vote
IFL
2003
Springer
15 years 11 months ago
2003
Springer
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
186
click to vote
IPTPS
2003
Springer
15 years 11 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
184
click to vote
WAIFI
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
155
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
: We present an extension of the programming-by-contract (PBC) paradigm to a concurrent and distributed environment. Classical PBC is characterized by absolute conformance of code ...
165
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...