Sciweavers

APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
13 years 11 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
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...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
AAIM
2009
Springer
132views Algorithms» more  AAIM 2009»
13 years 11 months ago
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
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...
Andrew V. Goldberg
ISDA
2009
IEEE
13 years 11 months ago
A Genetic Programming-Based Algorithm for Composing Web Services
—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...
Manuel Mucientes, Manuel Lama, Miguel I. Couto
IROS
2009
IEEE
275views Robotics» more  IROS 2009»
13 years 11 months ago
A stereo vision based mapping algorithm for detecting inclines, drop-offs, and obstacles for safe local navigation
— 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...
Aniket Murarka, Benjamin Kuipers
IROS
2009
IEEE
261views Robotics» more  IROS 2009»
13 years 11 months ago
Probabilistic motion planning among moving obstacles following typical motion patterns
— 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...
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
13 years 11 months ago
Planning fireworks trajectories for steerable medical needles to reduce patient trauma
— 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...
IPPS
2009
IEEE
13 years 11 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
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....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
INFOCOM
2009
IEEE
13 years 11 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
INFOCOM
2009
IEEE
13 years 11 months ago
Sensor Network Localization Using Sensor Perturbation
—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...
Yuanchen Zhu, Steven J. Gortler, Dylan Thurston
INFOCOM
2009
IEEE
13 years 11 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
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...
Liqun Fu, Soung Chang Liew, Jianwei Huang