Sciweavers

425 search results - page 32 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
AVI
2008
14 years 11 months ago
Realizing the hidden: interactive visualization and analysis of large volumes of structured data
An emerging trend in Web computing aims at collecting and integrating distributed data. For instance, community driven efforts recently have build ontological repositories made of...
Olaf Noppens, Thorsten Liebig
TCAD
2008
88views more  TCAD 2008»
14 years 9 months ago
Self-Adaptive Data Caches for Soft-Error Reliability
Soft-error induced reliability problems have become a major challenge in designing new generation microprocessors. Due to the on-chip caches' dominant share in die area and tr...
Shuai Wang, Jie S. Hu, Sotirios G. Ziavras
COMPGEOM
2009
ACM
15 years 4 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
TVCG
2008
174views more  TVCG 2008»
14 years 9 months ago
Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
Michael ten Caat, Natasha M. Maurits, Jos B. T. M....
90
Voted
JGAA
2002
86views more  JGAA 2002»
14 years 9 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim