Sciweavers

536 search results - page 95 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
HPDC
2007
IEEE
14 years 1 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
CIKM
2007
Springer
14 years 1 months ago
Hybrid results merging
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
VRST
2003
ACM
14 years 10 days ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 7 months ago
Learning methods for lung tumor markerless gating in image-guided radiotherapy
In an idealized gated radiotherapy treatment, radiation is delivered only when the tumor is at the right position. For gated lung cancer radiotherapy, it is difficult to generate ...
Ying Cui, Jennifer G. Dy, Gregory C. Sharp, Brian ...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 7 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu