Sciweavers

2875 search results - page 381 / 575
» Information Retrieval in Structured Domains
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 6 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...
259
Voted
ISCC
2009
IEEE
262views Communications» more  ISCC 2009»
16 years 1 months ago
Babelchord: a social tower of DHT-based overlay networks
Chord is a protocol to distribute and retrieve information at large scale. It builds a large but rigid overlay network without taking into account the social nature and the underl...
Luigi Liquori, Cédric Tedeschi, Francesco B...
ICDM
2003
IEEE
119views Data Mining» more  ICDM 2003»
15 years 11 months ago
A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering
Clustering by document concepts is a powerful way of retrieving information from a large number of documents. This task in general does not make any assumption on the data distrib...
Chihli Hung, Stefan Wermter
KBSE
1998
IEEE
15 years 10 months ago
Specification-based Browsing of Software Component Libraries
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
B. Fischer
ECCC
2007
144views more  ECCC 2007»
15 years 6 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III