Sciweavers

20294 search results - page 328 / 4059
» Algorithmic Information Theory
Sort
View
INFOSCALE
2006
ACM
16 years 23 days ago
Adaptive content management in structured P2P communities
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
Jussi Kangasharju, Keith W. Ross, David A. Turner
DAGM
2004
Springer
16 years 6 days ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
EGPGV
2004
Springer
181views Visualization» more  EGPGV 2004»
16 years 5 days ago
Parallel Multiresolution Volume Rendering of Large Data Sets with Error-Guided Load Balancing
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
Chaoli Wang, Jinzhu Gao, Han-Wei Shen
VISUALIZATION
2002
IEEE
15 years 11 months ago
Interactive Rendering of Large Volume Data Sets
We present a new algorithm for rendering very large volume data sets at interactive framerates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid...
Stefan Guthe, Michael Wand, Julius Gonser, Wolfgan...
COLT
2005
Springer
15 years 8 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour