Sciweavers

27 search results - page 1 / 6
» Digital Ink Compression via Functional Approximation
Sort
View
ICFHR
2010
136views Biometrics» more  ICFHR 2010»
12 years 12 months ago
Digital Ink Compression via Functional Approximation
Representing digital ink traces as points in a function space has proven useful for online recognition. Ink trace coordinates or their integral invariants are written as parametri...
Vadim Mazalov, Stephen M. Watt
COLT
2010
Springer
13 years 3 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
CORR
2010
Springer
241views Education» more  CORR 2010»
13 years 5 months ago
Haar Wavelet Based Approach for Image Compression and Quality Assessment of Compressed Image
With the increasing growth of technology and the entrance into the digital age, we have to handle a vast amount of information every time which often presents difficulties. So, the...
Kamrul Hasan Talukder, Koichi Harada
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 5 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
IAT
2005
IEEE
13 years 10 months ago
Decomposing Large-Scale POMDP Via Belief State Analysis
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
Xin Li, William K. Cheung, Jiming Liu