Sciweavers

2228 search results - page 401 / 446
» On Database Theory and XML
Sort
View
BIRTHDAY
2010
Springer
14 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
BMCBI
2010
95views more  BMCBI 2010»
14 years 10 months ago
Spatio-structural granularity of biological material entities
Background: With the continuously increasing demands on knowledge- and data-management that databases have to meet, ontologies and the theories of granularity they use become more...
Lars Vogt
JACM
2000
81views more  JACM 2000»
14 years 9 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
ICCV
2003
IEEE
15 years 11 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
GIS
2007
ACM
15 years 10 months ago
A model for enriching trajectories with semantic geographical information
The collection of moving object data is becoming more and more common, and therefore there is an increasing need for the efficient analysis and knowledge extraction of these data ...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...