Sciweavers

1021 search results - page 55 / 205
» Fast Approximate PCPs
Sort
View
GD
2009
Springer
15 years 6 months ago
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
Tim Dwyer, Lev Nachmanson
ICRA
1998
IEEE
157views Robotics» more  ICRA 1998»
15 years 6 months ago
VFH+: Reliable Obstacle Avoidance for Fast Mobile Robots
This paper presents further developments of the earlier Vector Field Histogram (VFH) method for realtime mobile robot obstacle avoidance. The enhanced method, called VFH+, offers ...
Iwan Ulrich, Johann Borenstein
NIPS
2008
15 years 3 months ago
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
Liang Zhang, Deepak Agarwal
EOR
2008
107views more  EOR 2008»
15 years 2 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
COMPGEOM
2006
ACM
15 years 8 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler