Sciweavers

19922 search results - page 3875 / 3985
» Human Computer Interaction
Sort
View
VISUALIZATION
2005
IEEE
15 years 10 months ago
Build-by-Number: Rearranging the Real World to Visualize Novel Architectural Spaces
We present Build-by-Number, a technique for quickly designing architectural structures that can be rendered photorealistically at interactive rates. We combine image-based capturi...
Daniel R. Bekins, Daniel G. Aliaga
VISUALIZATION
2005
IEEE
15 years 10 months ago
Exploiting Frame-to-Frame Coherence for Accelerating High-Quality Volume Raycasting on Graphics Hardware
GPU-based raycasting offers an interesting alternative to conventional slice-based volume rendering due to the inherent flexibility and the high quality of the generated images. ...
Thomas Klein, Magnus Strengert, Simon Stegmaier, T...
VISUALIZATION
2005
IEEE
15 years 10 months ago
Particle and Texture Based Spatiotemporal Visualization of Time-Dependent Vector Fields
We propose a hybrid particle and texture based approach for the visualization of time-dependent vector fields. The underlying spacetime framework builds a dense vector field rep...
Daniel Weiskopf, Frederik Schramm, Gordon Erlebach...
ACMSE
2005
ACM
15 years 10 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 10 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
« Prev « First page 3875 / 3985 Last » Next »