Sciweavers

179 search results - page 16 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
WWW
2007
ACM
14 years 8 months ago
Bridging the gap between OWL and relational databases
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
Boris Motik, Ian Horrocks, Ulrike Sattler
ICLP
2009
Springer
14 years 8 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
ECOOP
1998
Springer
13 years 12 months ago
Orthogonal to the Java Imperative
Three nontrivial limitations of the existing JavaT M technology are considered from the viewpoint of object-oriented database technology. The limitations are: lack of support for o...
Suad Alagic, Jose Solorzano, David Gitchell
CVPR
2007
IEEE
14 years 9 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
WWW
2001
ACM
14 years 8 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...