Sciweavers

91 search results - page 7 / 19
» Abstraction, Levels of Detail, and Hierarchies in Map Series
Sort
View
TCAD
2008
102views more  TCAD 2008»
13 years 7 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
IPPS
2010
IEEE
13 years 5 months ago
User level DB: a debugging API for user-level thread libraries
With the advent of the multicore era, parallel programming is becoming ubiquitous. Multithreading is a common approach to benefit from these architectures. Hybrid M:N libraries lik...
Kevin Pouget, Marc Pérache, Patrick Carriba...
BTW
2007
Springer
166views Database» more  BTW 2007»
14 years 1 months ago
Hierarchy-driven Visual Exploration of Multidimensional Data Cubes
: Analysts interact with OLAP data in a predominantly “drill-down” fashion, i.e. gradually descending from a coarsely grained overview towards the desired level of detail. Anal...
Svetlana Mansmann, Florian Mansmann, Marc H. Schol...
SIGGRAPH
2000
ACM
13 years 12 months ago
Illuminating micro geometry based on precomputed visibility
Many researchers have been arguing that geometry, bump maps, and BRDFs present a hierarchy of detail that should be exploited for efficient rendering purposes. In practice howeve...
Wolfgang Heidrich, Katja Daubert, Jan Kautz, Hans-...
GD
1999
Springer
13 years 12 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...