Sciweavers

115 search results - page 12 / 23
» Compressed text indexes: From theory to practice
Sort
View
EACL
2003
ACL Anthology
13 years 8 months ago
NLP for Indexing and Retrieval of Captioned Photographs
We present a text-based approach for the automatic indexing and retrieval of digital photographs taken at crime scenes. Our research prototype, SOCIS, goes beyond keyword-based ap...
Horacio Saggion, Katerina Pastra, Yorick Wilks
DCC
2010
IEEE
14 years 2 months ago
Xampling: Analog Data Compression
We introduce Xampling, a design methodology for analog compressed sensing in which we sample analog bandlimited signals at rates far lower than Nyquist, without loss of informatio...
Moshe Mishali, Yonina C. Eldar
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
CIKM
2007
Springer
14 years 1 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 7 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...