1888 search results - page 57 / 378 » Algorithms for Querying by Spatial Structure |
132
click to vote
COCO
1989
Springer
15 years 8 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
158
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Abstract: In the automotive and aerospace industry, millions of technical documents are generated during the development of complex engineering products. Particularly, the universa...
251
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
132
click to vote
TKDE
2002
15 years 4 months ago
2002
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
128
click to vote
GIS
2010
ACM
15 years 3 months ago
2010
ACM
Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of ...