Sciweavers

1213 search results - page 157 / 243
» Approximation in quantale-enriched categories
Sort
View
CGF
2010
171views more  CGF 2010»
14 years 7 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
CGF
2010
168views more  CGF 2010»
14 years 7 months ago
How to Write a Visualization Research Paper: A Starting Point
This paper attempts to explain the mechanics of writing a research paper in visualization. This serves as a useful starting point for those who have never written a research paper...
Robert S. Laramee
TOMS
2011
101views more  TOMS 2011»
14 years 5 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
VLDB
2011
ACM
276views Database» more  VLDB 2011»
14 years 5 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin
TOG
2010
106views more  TOG 2010»
14 years 5 months ago
Accelerating spatially varying Gaussian filters
High-dimensional Gaussian filters, most notably the bilateral filter, are important tools for many computer graphics and vision tasks. In recent years, a number of techniques for ...
Jongmin Baek, David E. Jacobs