Sciweavers

727 search results - page 90 / 146
» One line and n points
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
14 years 11 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
DM
2008
103views more  DM 2008»
14 years 10 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
ALGORITHMICA
2006
109views more  ALGORITHMICA 2006»
14 years 10 months ago
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
: We study the output-sensitive computations of all the combinations of the edges and vertices of a simple polygon P that allow a form closure grasp with less than four point conta...
Jae-Sook Cheong, Herman J. Haverkort, A. Frank van...
ORL
2008
63views more  ORL 2008»
14 years 10 months ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno
APPROX
2010
Springer
137views Algorithms» more  APPROX 2010»
14 years 11 months ago
Online Embeddings
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
Piotr Indyk, Avner Magen, Anastasios Sidiropoulos,...