Sciweavers

6568 search results - page 959 / 1314
» Reducing the Complexity of Reductions
Sort
View
ICDCS
2010
IEEE
15 years 10 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
APAL
2010
85views more  APAL 2010»
15 years 7 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
CGF
2007
128views more  CGF 2007»
15 years 6 months ago
Stackless KD-Tree Traversal for High Performance GPU Ray Tracing
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet availa...
Stefan Popov, Johannes Günther, Hans-Peter Se...
CN
2007
132views more  CN 2007»
15 years 6 months ago
FluNet: A hybrid internet simulator for fast queue regimes
Motivated by the scale and complexity of simulating large-scale networks, recent research has focused on hybrid fluid/packet simulators, where fluid models are combined with pac...
Yung Yi, Sanjay Shakkottai
BMCBI
2005
91views more  BMCBI 2005»
15 years 6 months ago
Providing visualisation support for the analysis of anatomy ontology data
Background: Improvements in technology have been accompanied by the generation of large amounts of complex data. This same technology must be harnessed effectively if the knowledg...
Aba-Sah Dadzie, Albert Burger