Sciweavers

2969 search results - page 57 / 594
» A space efficient algorithm for group structure computation
Sort
View
CG
2005
Springer
15 years 3 months ago
Hyper-Resolution: Image detail reconstruction through parametric edges
Hyper-Resolution, a new technique for super-resolution reconstruction of images, is based on matching lowresolution target image details to their high-resolution counterparts from...
Lijun Yin, Matt T. Yourst
IMR
1998
Springer
15 years 7 months ago
Mesh Graph Structure for Longest-Edge Refinement Algorithms
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
Angel Plaza, José P. Suárez, Miguel ...
118
Voted
CAD
2007
Springer
15 years 3 months ago
Computing general geometric structures on surfaces using Ricci flow
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
Miao Jin, Feng Luo 0002, Xianfeng David Gu
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 10 days ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
CVPR
2012
IEEE
13 years 5 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...