Sciweavers

2635 search results - page 251 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICAIL
2003
ACM
16 years 12 days ago
Induction of Defeasible Logic Theories in the Legal Domain
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
Benjamin Johnston, Guido Governatori
228
Voted
DGCI
2000
Springer
15 years 10 months ago
An Efficient Shape-Based Approach to Image Retrieval
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
Ioannis Fudos, Leonidas Palios
PAMI
2007
214views more  PAMI 2007»
15 years 6 months ago
2D Affine-Invariant Contour Matching Using B-Spline Model
—This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the nonuniqueness of B-Spline in curve matching. This metho...
Yue Wang, Eam Khwang Teoh
PODS
2010
ACM
242views Database» more  PODS 2010»
16 years 6 days ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
211
Voted
BMCBI
2010
183views more  BMCBI 2010»
15 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...