1594 search results - page 91 / 319 » An Algorithm to Compute Collusion Paths |
153
click to vote
FOIKS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
111
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
120
click to vote
IDA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
143
click to vote
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— This paper describes the design and testing of a technique to enable long-range autonomous navigation using a stereo camera as the only sensor. During a learning phase, the rov...
107
click to vote
EOR
2008
15 years 3 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...