Sciweavers

349 search results - page 23 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
JCT
2011
89views more  JCT 2011»
13 years 2 months ago
On lines, joints, and incidences in three dimensions
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
György Elekes, Haim Kaplan, Micha Sharir
WG
2004
Springer
14 years 1 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
CGF
2006
125views more  CGF 2006»
13 years 8 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
JCT
2011
115views more  JCT 2011»
13 years 2 months ago
Sharp thresholds for hypergraph regressive Ramsey numbers
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
SCHEDULING
2010
74views more  SCHEDULING 2010»
13 years 6 months ago
Term-end exam scheduling at United States Military Academy/West Point
Scheduling term-end exams (TEE) at the United States Military Academy in West Point is unlike any other exam timetabling problem we know of. Exam timetabling normally produces a c...
Siqun Wang, Michael R. Bussieck, Monique Guignard,...