Sciweavers

274 search results - page 10 / 55
» Computational complexity of queries based on itemsets
Sort
View
HPDC
2008
IEEE
15 years 7 months ago
Ontological framework for a free-form query based grid search engine
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
Chaitali Gupta, Rajdeep Bhowmik, Madhusudhan Govin...
CW
2005
IEEE
15 years 6 months ago
Applying Transformation-Based Error-Driven Learning to Structured Natural Language Queries
XML information retrieval (XML-IR) systems aim to provide users with highly exhaustive and highly specific results. To interact with XML-IR systems, users must express both their ...
Alan Woodley, Shlomo Geva
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
15 years 5 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
203
Voted
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
16 years 2 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
SUM
2009
Springer
15 years 7 months ago
Query Answering in Belief Logic Programming
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
Hui Wan, Michael Kifer