CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Ontology-Based Information Extraction (OBIE) has recently emerged as a subfield of Information Extraction (IE). Here, ontologies - which provide formal and explicit specificatio...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
To receive personalized web services, the user has to provide personal information and preferences, in addition to the query itself, to the web service. However, detailed personal...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Collaborative tagging systems allow users to use tags to describe their favourite online documents. Two documents that are maintained in the collection of the same user and/or ass...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
We propose a simple yet eective approach to context sensitive synonym discovery for Web search queries based on co-click analysis; i.e., analyzing queries leading to clicking sam...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we present YAM, a schema matcher factory. YAM (Yet Another Matcher) is not (yet) another schema matching system as it enables the generation of a la carte schema ma...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Given a drug under development, what are other drugs or biochemical compounds that it might interact with? Early answers to this question, by mining the literature, are valuable f...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...