Sciweavers

1217 search results - page 226 / 244
» On compressing frequent patterns
Sort
View
127
Voted
BMCBI
2008
103views more  BMCBI 2008»
15 years 3 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 3 months ago
Similarity of Objects and the Meaning of Words
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...
Rudi Cilibrasi, Paul M. B. Vitányi
142
Voted
TSP
2008
151views more  TSP 2008»
15 years 3 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
130
Voted
PAMI
2000
142views more  PAMI 2000»
15 years 3 months ago
Evolutionary Pursuit and Its Application to Face Recognition
Abstract-- This paper introduces Evolutionary Pursuit (EP) as a novel and adaptive representation method for image encoding and classification. In analogy to projection pursuit met...
Chengjun Liu, Harry Wechsler
140
Voted
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 3 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky