Sciweavers

3946 search results - page 143 / 790
» The computational complexity of choice sets
Sort
View
IV
1999
IEEE
115views Visualization» more  IV 1999»
15 years 10 months ago
Interaction with the Reorderable Matrix
The Reorderable Matrix is a simple visualization method for quantitative tabular data. This paper examines how first-time users interact with the Reorderable Matrix and how well t...
Harri Siirtola
SIGGRAPH
1996
ACM
15 years 10 months ago
A Volumetric Method for Building Complex Models from Range Images
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
Brian Curless, Marc Levoy
TVCG
2008
124views more  TVCG 2008»
15 years 6 months ago
Effective visualization of complex vascular structures using a non-parametric vessel detection method
The effective visualization of vascular structures is critical for diagnosis, surgical planning as well as treatment evaluation. In recent work, we have developed an algorithm for ...
Alark Joshi, Xiaoning Qian, Donald P. Dione, Ketan...
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 9 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
ICPR
2002
IEEE
16 years 7 months ago
A Computationally Efficient Approach to Indoor/Outdoor Scene Classification
Prior research in scene classification has shown that high-level information can be inferred from low-level image features. Classification rates of roughly 90% have been reported ...
Navid Serrano, Andreas E. Savakis, Jiebo Luo