Sciweavers

5372 search results - page 818 / 1075
» complexity 2007
Sort
View
ICDT
2007
ACM
126views Database» more  ICDT 2007»
16 years 23 days ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
ICDT
2007
ACM
107views Database» more  ICDT 2007»
16 years 23 days ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
ICDT
2007
ACM
141views Database» more  ICDT 2007»
16 years 23 days ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
ICIC
2007
Springer
16 years 23 days ago
Rough Set Theory of Shape Perception
Humans can easily recognize complex objects even if values of their attributes are imprecise and often inconsistent. It is not clear how the brain processes uncertain visual inform...
Andrzej W. Przybyszewski
ICOST
2007
Springer
16 years 23 days ago
Tracking People in Indoor Environments
Tracking the movement of people in indoor environments is useful for a variety of applications including elderly care, study of shopper behavior in shopping centers, security etc. ...
Candy Yiu, Suresh Singh