Sciweavers

1567 search results - page 51 / 314
» Compressing Relations and Indexes
Sort
View
WWW
2005
ACM
14 years 9 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
ECIR
2003
Springer
13 years 10 months ago
A Weighting Scheme for Star-Graphs
We present in this paper a relational approach for indexing and retrieving photographs from a collection. Instead of using simple keywords as an indexing language, we propose to u...
Jean Martinet, Iadh Ounis, Yves Chiaramella, Phili...
COLING
2008
13 years 10 months ago
A Concept-Centered Approach to Noun-Compound Interpretation
A noun-compound is a compressed proposition that requires an audience to recover the implicit relationship between two concepts that are expressed as nouns. Listeners recover this...
Cristina Butnariu, Tony Veale
DCC
2007
IEEE
14 years 8 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
DATESO
2010
184views Database» more  DATESO 2010»
13 years 7 months ago
iXUPT: Indexing XML Using Path Templates
The XML format has become the standard for data exchange because it is self-describing and it stores not only information but also the relationships between data. Therefore it is u...
Tomás Bartos, Ján Kasarda