Sciweavers

6315 search results - page 164 / 1263
» Approximating Solution Structure
Sort
View
ICDIM
2008
IEEE
16 years 27 days ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
15 years 12 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
ICIP
2005
IEEE
16 years 8 months ago
Approximation power of directionlets
In spite of the success of the standard wavelet transform (WT) in image processing, the efficiency of its representation is limited by the spatial isotropy of its basis functions ...
Vladan Velisavljevic, Baltasar Beferull-Lozano, Ma...
ISBI
2006
IEEE
16 years 7 months ago
A novel approximate inference approach to automated classification of protein subcellular location patterns in multi-cell images
The subcellular location of proteins is most often determined by visual interpretation of fluorescence microscope images. In recent years, automated systems have been developed so...
Shann-Ching Chen, Geoffrey J. Gordon, Robert F. Mu...
SPIRE
2007
Springer
16 years 17 days ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...