Sciweavers

49 search results - page 5 / 10
» Recent Progress and Open Problems in Algorithmic Convex Geom...
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 8 months ago
A Lightweight Online Framework For Query Progress Indicators
Recently there has been increasing interest in the development of progress indicators for SQL queries. In this paper we present a lightweight online framework for this problem. Ou...
Chaitanya Mishra, Nick Koudas
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
13 years 11 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
DIMACS
2001
13 years 8 months ago
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
Ileana Streinu
RSS
2007
126views Robotics» more  RSS 2007»
13 years 9 months ago
Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
Katsu Yamane, Yoshihiko Nakamura
CAAN
2007
Springer
14 years 1 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....