Sciweavers

419 search results - page 10 / 84
» Improving Adaptable Similarity Query Processing by Using App...
Sort
View
JUCS
2002
120views more  JUCS 2002»
13 years 8 months ago
Instance Cooperative Memory to Improve Query Expansion in Information Retrieval Systems
The main goal of this research is to improve Information Retrieval Systems by enabling them to generate search outcomes that are relevant and customized to each specific user. Our ...
Lobna Jeribi, Béatrice Rumpler
CIDR
2009
155views Algorithms» more  CIDR 2009»
13 years 9 months ago
LifeRaft: Data-Driven, Batch Processing for the Exploration of Scientific Databases
Workloads that comb through vast amounts of data are gaining importance in the sciences. These workloads consist of "needle in a haystack" queries that are long running ...
Xiaodan Wang, Randal C. Burns, Tanu Malik
IS
2011
13 years 3 months ago
Similarity of business process models: Metrics and evaluation
—It is common for large and complex organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given suc...
Remco M. Dijkman, Marlon Dumas, Boudewijn F. van D...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 10 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch