Sciweavers

697 search results - page 94 / 140
» Convex Functions on Discrete Sets
Sort
View
ICRA
2006
IEEE
114views Robotics» more  ICRA 2006»
14 years 2 months ago
Blades: a New Class of Geometric Primitives for Feeding 3D Parts on Vibratory Tracks
Abstract— The vibratory bowl feeder remains the most common approach to the automated feeding (orienting) of industrial parts. We study the algorithmic design of devices on the b...
Onno C. Goemans, Kenneth Y. Goldberg, A. Frank van...
VLDB
1998
ACM
97views Database» more  VLDB 1998»
14 years 28 days ago
Design and Analysis of Parametric Query Optimization Algorithms
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...
Sumit Ganguly
STACS
1992
Springer
14 years 23 days ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
MP
2008
135views more  MP 2008»
13 years 8 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye