Sciweavers

2069 search results - page 232 / 414
» Linear time algorithms for Clobber
Sort
View
ICMCS
2005
IEEE
81views Multimedia» more  ICMCS 2005»
16 years 4 days ago
Multiple Objective Frame Rate Up Conversion
In this paper, we propose a multiple objective frame rate up conversion algorithm (MOFRUC), which utilizes two different models. The first model is a constant velocity model that ...
Tak-Song Chong, Oscar C. Au, Wing-San Chau, Tai-Wa...
ICRA
1999
IEEE
75views Robotics» more  ICRA 1999»
15 years 10 months ago
Trap Design for Vibratory Bowl Feeders
The vibratory bowl feeder is the oldest and still most common approach to the automated feeding (orienting) of industrial parts. In this paper we consider a class of vibratory bow...
Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrenc...
APPINF
2003
15 years 8 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar
IPL
2008
105views more  IPL 2008»
15 years 6 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...