Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
35
Aspects of endowment: a query theory of value construction.
- J. Exp. Psychol. Learn Mem. Cogn.
, 2007
"... ), in which participants are randomly given either a good, such as a coffee mug, that they may later sell ("sellers") or a choice between the good and amounts of cash ("choosers"). Sellers typically demand at least twice as much as choosers, inconsistent with economic theory. Th ..."
Abstract
-
Cited by 35 (5 self)
- Add to MetaCart
. This result is usually explained by an increased weighting of losses, or loss aversion. The authors provide a memory-based account of endowment, suggesting that people construct values by posing a series of queries whose order differs for sellers and choosers. Because of output interference, these queries
Interactive Analysis of Attack Graphs Using Relational Queries
"... Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed and implemented, causing a delay in the availability of analysis. Such a delay is usually unacceptable because the needs for anal ..."
Abstract
-
Cited by 9 (5 self)
- Add to MetaCart
is now possible, because relational queries can be dynamically constructed and revised at run time. Moreover, the mature optimization techniques in relational databases can also improve the performance of the analysis.
A Visual Query Language for Relational Knowledge Discovery
, 2001
"... QGRAPH is a visual query language for knowledge discovery in relational data. Using QGRAPH, a user can query and update relational data in ways that support data exploration, data transformation, and sampling. When combined with modeling algorithms, such as those developed in inductive logic prog ..."
Abstract
-
Cited by 11 (5 self)
- Add to MetaCart
queries are annotated graphs that reflect potential structures within a database. QGRAPH treats objects, links, and attributes as first-class entities, so its queries can dynamically alter a data schema by adding and deleting those entities. Finally, the language provides grouping and counting
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Querying Geometric Figures Using a Controlled Language, Ontological Graphs and Dependency Lattices?
"... Abstract. Dynamic geometry systems (DGS) have become basic tools in many areas of geometry as, for example, in education. Geometry Au-tomated Theorem Provers (GATP) are an active area of research and are considered as being basic tools in future enhanced educational software as well as in a next gen ..."
Abstract
- Add to MetaCart
the need of a query mechanism for descriptions of geometric constructions. In this paper we discuss two approaches for describing geometric figures (declarative and procedural), and present algorithms for querying geo-metric figures in declaratively and procedurally described corpora, by using a DGS or a
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling
- In WWW
, 2014
"... We propose two dynamic indexing schemes for shortest-path and distance queries on large time-evolving graphs, which are useful in a wide range of important applications such as real-time network-aware search and network evolution anal-ysis. To the best of our knowledge, these methods are the first p ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We propose two dynamic indexing schemes for shortest-path and distance queries on large time-evolving graphs, which are useful in a wide range of important applications such as real-time network-aware search and network evolution anal-ysis. To the best of our knowledge, these methods are the first
Interactive Reasoning in Uncertain RDF Knowledge Bases
"... Recent advances in Web-based information extraction have allowed for the automatic construction of large, semantic knowledge bases, which are typically captured in RDF format. The very nature of the applied extraction techniques however entails that the resulting RDF knowledge bases may face a signi ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
to the reasoning backend, including tasks like exploring the knowledge base, rule-based and statistical reasoning, faceted browsing of large query graphs, and explaining answers through lineage.
Verification of Description Logic Knowledge and Action Bases
, 2012
"... doi:10.3233/978-1-61499-098-7-103 ..."
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Results 1 - 10
of
35
