Sciweavers

1091 search results - page 140 / 219
» On the temporal dimension of search
Sort
View
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 1 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
DICTA
2003
15 years 1 months ago
Real-Time Detection, Registration and Recognition Using Pixel-Level Fusion of Active/Passive Imagery
  -  A  system  has  been  developed  whereby  active  ladar  and  passive  electro-optic  imaging  data  are  aligned  in  hardware  at  the  pixel  level. ...
Alan Steinberg, Robert Pack
ICASSP
2010
IEEE
15 years 3 days ago
Sparsity-cognizant overlapping co-clustering for behavior inference in social networks
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
Hao Zhu, Gonzalo Mateos, Georgios B. Giannakis, Ni...
ICASSP
2010
IEEE
15 years 3 days ago
An L1 criterion for dictionary learning by subspace identification
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...
Florent Jaillet, Rémi Gribonval, Mark D. Pl...
IPM
2006
132views more  IPM 2006»
14 years 12 months ago
A framework for understanding Latent Semantic Indexing (LSI) performance
In this paper we present a theoretical model for understanding the performance of Latent Semantic Indexing (LSI) search and retrieval applications. Many models for understanding L...
April Kontostathis, William M. Pottenger