Sciweavers

710 search results - page 21 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
DEXA
2009
Springer
151views Database» more  DEXA 2009»
14 years 2 months ago
Automatic Extraction of Ontologies Wrapping Relational Data Sources
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
Lina Lubyte, Sergio Tessaris
CSL
2007
Springer
13 years 11 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
CIVR
2004
Springer
111views Image Analysis» more  CIVR 2004»
14 years 1 months ago
An Inference Network Approach to Image Retrieval
Most image retrieval systems only allow a fragment of text or an example image as a query. Most users have more complex information needs that are not easily expressed in either of...
Donald Metzler, R. Manmatha
SIGCOMM
2005
ACM
14 years 1 months ago
Declarative routing: extensible routing with declarative queries
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, ...
ATVA
2009
Springer
158views Hardware» more  ATVA 2009»
14 years 2 months ago
Logahedra: A New Weakly Relational Domain
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popula...
Jacob M. Howe, Andy King