1578 search results - page 164 / 316 » Direct Routing: Algorithms and Complexity |
154
click to vote
PCM
2005
Springer
15 years 8 months ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
111
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
101
click to vote
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper presents a novel approach to the multi-vehicle Simultaneous Localisation and Mapping (SLAM) problem that exploits the manner in which observations are fused into the gl...
100
click to vote
ITNG
2007
IEEE
15 years 9 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
164
click to vote
ISPA
2004
Springer
15 years 8 months ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...