1038 search results - page 13 / 208 » Space-Bounded Query Approximation |
173
click to vote
AAAI
2007
15 years 8 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
160
click to vote
GEOINFORMATICA
1998
15 years 5 months ago
1998
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
161
click to vote
JASIS
2010
15 years 4 months ago
2010
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
158
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
140
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...