Sciweavers

815 search results - page 75 / 163
» Approximate Entropy Reducts
Sort
View
BC
1998
96views more  BC 1998»
14 years 11 months ago
Evidence of phase transitions in heart period dynamics
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
Henrik Bettermann, Peter Van Leeuwen
ICIP
2008
IEEE
16 years 1 months ago
Sparse orthonormal transforms for image compression
We propose a block-based transform optimization and associated image compression technique that exploits regularity along directional image singularities. Unlike established work,...
Osman Gokhan Sezer, Oztan Harmanci, Onur G. Gulery...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 6 days ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
CVPR
2010
IEEE
15 years 8 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
SPIRE
2010
Springer
14 years 10 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi