4565 search results - page 609 / 913 » Time Optimal Self-Stabilizing Algorithms |
141
click to vote
FPL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
148
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
107
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we consider the problem of compositing a scene from multiple images. Multiple images, for example, can be obtained by varying the exposure of the camera, by changin...
117
Voted
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper presents an approach to time-optimal kinodynamic motion planning for a mobile robot. A global path planner is used to generate collision-free straight-line paths fro...
130
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...