Sciweavers

2859 search results - page 468 / 572
» Querying Complex Structured Databases
Sort
View
AIM
2004
13 years 8 months ago
Qualitative Spatial Reasoning Extracting and Reasoning with Spatial Aggregates
Reasoning about spatial data is a key task in many applications, including geographic information systems, meteorological and fluid flow analysis, computer-aided design, and prote...
Christopher Bailey-Kellogg, Feng Zhao
PRL
2000
104views more  PRL 2000»
13 years 8 months ago
PicSOM - content-based image retrieval with self-organizing maps
We have developed a novel system for content-based image retrieval in large, unannotated databases. The system is called PicSOM, and it is based on tree structured self-organizing...
Jorma Laaksonen, Markus Koskela, Sami Laakso, Erkk...
TALG
2010
110views more  TALG 2010»
13 years 6 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx

Publication
217views
15 years 7 months ago
Towards Efficient Search on Unstructured Data: An Intelligent-Storage Approach
Applications that create and consume unstructured data have grown both in scale of storage requirements and complexity of search primitives. We consider two such applications: exha...
Aravindan Raghuveer, Biplob K. Debnath, David Hung...
STACS
2009
Springer
14 years 2 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...