103 search results - page 9 / 21 » The effect of corners on the complexity of approximate range... |
ADL
2000
Springer
14 years 8 days ago
2000
Springer
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
CAV
2007
Springer
13 years 12 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
ECAI
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
SSDBM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...