3471 search results - page 259 / 695 » Obstacle Numbers of Graphs |
149
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
135
click to vote
IH
2007
Springer
16 years 10 days ago
2007
Springer
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
150
click to vote
ICRA
2006
IEEE
16 years 7 days ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
172
click to vote
SCIA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
164
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...