The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
—Web Services are interfaces that describe a collection of operations that are network-accessible through standardized web protocols. When a required operation is not found, seve...
— Mobile robots have to detect and handle a variety of potential hazards to navigate autonomously. We present a real-time stereo vision based mapping algorithm for identifying an...
— The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. Pede...
Chiara Fulgenzi, Anne Spalanzani, Christian Laugie...
— Accurate needle insertion in 3D environment is always a grand challenge. When multiple targets are located in the tissue, a procedure of inserting multiple needles from a singl...
Jijie Xu, Vincent Duindam, Ron Alterovitz, Jean Po...
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...