Sciweavers

3092 search results - page 99 / 619
» Where are you pointing
Sort
View
ICPR
2008
IEEE
16 years 3 days ago
Finding the splitting vector for image resolution up-conversion
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...
Xinyu Xu, Hao Pan
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 9 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
15 years 5 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
CG
2004
Springer
15 years 5 months ago
Dynamic surfel set refinement for high-quality rendering
Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for la...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 4 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi