Sciweavers

756 search results - page 62 / 152
» Quantization of Sparse Representations
Sort
View
VIS
2003
IEEE
116views Visualization» more  VIS 2003»
14 years 9 months ago
Space Efficient Fast Isosurface Extraction for Large Datasets
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
Udeepta Bordoloi, Han-Wei Shen
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 8 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
AVBPA
2005
Springer
240views Biometrics» more  AVBPA 2005»
14 years 1 months ago
Practical Biometric Authentication with Template Protection
Abstract. In this paper we show the feasibility of template protecting biometric authentication systems. In particular, we apply template protection schemes to fingerprint data. T...
Pim Tuyls, Anton H. M. Akkermans, Tom A. M. Kevena...
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 9 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
ICASSP
2009
IEEE
14 years 2 months ago
Color image feature extraction using color index local auto-correlations
In this paper, we propose a method for extracting color image features, called color index local auto-correlations. Pixel color is quantized and described sparsely in a manner sim...
Takumi Kobayashi, Nobuyuki Otsu