Sciweavers

667 search results - page 18 / 134
» Computably Based Locally Compact Spaces
Sort
View
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
13 years 11 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
ICML
2007
IEEE
14 years 8 months ago
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
Sridhar Mahadevan
CVPR
2009
IEEE
14 years 2 months ago
Manifold Discriminant Analysis
This paper presents a novel discriminative learning method, called Manifold Discriminant Analysis (MDA), to solve the problem of image set classification. By modeling each image s...
Ruiping Wang, Xilin Chen
DCC
1998
IEEE
14 years 4 days ago
A Locally Optimal Design Algorithm for Block-Based Multi-Hypothesis Motion-Compensated Prediction
Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis mo...
Markus Flierl, Thomas Wiegand, Bernd Girod
ICCV
2003
IEEE
14 years 9 months ago
Space-time Interest Points
Local image features or interest points provide compact ract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points int...
Ivan Laptev, Tony Lindeberg