Results 1 - 10 of 396

Query-driven constraint acquisition

by Christian Bessiere, Remi Coletta - in Proc. Twentieth Internatioal Joint Conference on Artificial Intelligence-IJCAI’07 , 2007
"... The modelling and reformulation of constraint networks are recognised as important problems. The task of automatically acquiring a constraint network formulation of a problem from a subset of its solutions and non-solutions has been presented in the literature. However, the choice of such a subset w ..."
Abstract - Cited by 18 (5 self) - Add to MetaCart
was assumed to be made independently of the acquisition process. We present an approach in which an interactive acquisition system actively selects a good set of examples. We show that the number of examples required to acquire a constraint network is significantly reduced using our approach. 1

H.: Query-driven program testing

by Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith , 2008
"... Abstract. We present a new approach to program testing which enables the pro-grammer to specify test suites in terms of a versatile query language. Our query language subsumes standard coverage criteria ranging from simple basic block coverage all the way to predicate complete coverage and multiple ..."
Abstract - Cited by 11 (3 self) - Add to MetaCart
algorithmic contribu-tion is a method called iterative constraint strengthening which enables us to solve a query for an arbitrary coverage criterion by a single call to the model checker and a novel form of incremental SAT solving: Whenever the SAT solver finds a solution, our algorithm compares

On The Use of Query-Driven XML Auto-Indexing

by Karsten Schmidt - In Proc. ICDE SMDB Workshop , 2010
"... Abstract — Autonomous index management in native XML DBMSs has to address XML’s flexibility and storage map-ping features, which provide a rich set of indexing options. Change of workload characteristics, indexes selected by the query optimizer’s “magic”, subtle differences in the expressiveness of ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract — Autonomous index management in native XML DBMSs has to address XML’s flexibility and storage map-ping features, which provide a rich set of indexing options. Change of workload characteristics, indexes selected by the query optimizer’s “magic”, subtle differences in the expressiveness

Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach

by Shashi Shekhar, Shashi Shekhar, Babak Hamidzadeh, Babak Hamidzadeh, Ashim Kohli, Ashim Kohli, Mark Coyle, Mark Coyle - IEEE Transactions on Knowledge and Data Engineering , 1993
"... Learning query transformation rules is vital for the success of semantic query optimization in domains where the user cannot provide a comprehensive set of integrity constraints. Finding these rules is a discovery task because of the lack of target. Previous approaches to learning query transform ..."
Abstract - Cited by 41 (1 self) - Add to MetaCart
Learning query transformation rules is vital for the success of semantic query optimization in domains where the user cannot provide a comprehensive set of integrity constraints. Finding these rules is a discovery task because of the lack of target. Previous approaches to learning query

The carbon balance of tropical, temperate and boreal forests.

by Y Malhi , D D Baldocchi , P G Jarvis , Rd6 - Plant Cell and Environment, , 1999
"... ABSTRACT Forest biomes are major reserves for terrestrial carbon, and major components of global primary productivity. The carbon balance of forests is determined by a number of component processes of carbon acquisition and carbon loss, and a small shift in the magnitude of these processes would ha ..."
Abstract - Cited by 102 (2 self) - Add to MetaCart
ABSTRACT Forest biomes are major reserves for terrestrial carbon, and major components of global primary productivity. The carbon balance of forests is determined by a number of component processes of carbon acquisition and carbon loss, and a small shift in the magnitude of these processes would

Query Driven Sequence Pattern Mining

by Pedro G. Ferreira, Paulo J. Azevedo - XXI SIMPÓSIO BRASILEIRO DE BANCO DE DADOS
"... The discovery of frequent patterns present in biological sequences has a large number of applications, ranging from classification, clustering and understanding sequence structure and function. This paper presents an algorithm that discovers frequent sequence patterns (motifs) present in a query se ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
sequence in respect to a database of sequences. The query is used to guide the mining process and thus only the patterns present in the query are reported. Two main types of patterns can be identified: flexible and rigid gap patterns. The user can choose to report all or only maximal patterns. Constraints

Debunking some myths about structured and unstructured overlays

by Miguel Castro, Manuel Costa, Antony Rowstron - In Proc. of NSDI , 2005
"... We present a comparison of structured and unstructured overlays that decouples overlay topology maintenance from query mechanism. Structured overlays provide efficient support for simple exact-match queries but they constrain overlay topology to achieve this. Unstructured overlays do not constrain o ..."
Abstract - Cited by 69 (0 self) - Add to MetaCart
overlay topology or query complexity because they use flooding or random walks to discover data. It is commonly believed that structured overlays are more expensive to maintain, that their topology constraints make it harder to exploit heterogeneity, and that they cannot support complex queries

Feedback-Driven Structural Query Expansion for Ranked Retrieval of XML Data

by Ralf Schenkel, Martin Theobald - In EDBT , 2006
"... Abstract. Relevance Feedback is an important way to enhance retrieval quality by integrating relevance information provided by a user. In XML retrieval, feedback engines usually generate an expanded query from the content of elements marked as relevant or nonrelevant. This approach that is inspired ..."
Abstract - Cited by 14 (1 self) - Add to MetaCart
by text-based IR completely ignores the semistructured nature of XML. This paper makes the important step from content-based to structural feedback. It presents an integrated solution for expanding keyword queries with new content, path, and document constraints. An extensible framework evaluates

Distance-constraint reachability computation in uncertain graphs

by Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang - PVLDB
"... Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call the distance-constraint reachability (DCR) problem: Given two vertices s and t, what is ..."
Abstract - Cited by 26 (5 self) - Add to MetaCart
Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call the distance-constraint reachability (DCR) problem: Given two vertices s and t, what

Automatic Termination Analysis of Logic Programs

by Naomi Lindenstrauss, Yehoshua Sagiv - Proceedings of the Fourteenth International Conference on Logic Programming , 1997
"... This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be non-termination. The system can use any norm of a wide family of norms. It ca ..."
Abstract - Cited by 63 (3 self) - Add to MetaCart
This paper describes a system implemented in SICStus Prolog for automatically checking left termination of logic programs. Given a program and query, the system answers either that the query terminates or that there may be non-termination. The system can use any norm of a wide family of norms
Results 1 - 10 of 396