Sciweavers

6274 search results - page 56 / 1255
» From query complexity to computational complexity
Sort
View
IUI
2009
ACM
14 years 6 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
NOMS
2010
IEEE
136views Communications» more  NOMS 2010»
13 years 8 months ago
Supporting System-wide Similarity Queries for networked system management
Abstract— Today’s networked systems are extensively instrumented for collecting a wealth of monitoring data. In this paper, we propose a framework called System-wide Similarity...
Songyun Duan, Hui Zhang 0002, Guofei Jiang, Xiaoqi...
ICCS
2009
Springer
14 years 4 months ago
Querying for Feature Extraction and Visualization in Climate Modeling
The ultimate goal of data visualization is to clearly portray features relevant to the problem being studied. This goal can be realized only if users can effectively communicate t...
C. Ryan Johnson, Markus Glatter, Wesley Kendall, J...
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
14 years 4 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
CGF
2004
113views more  CGF 2004»
13 years 9 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...