Sciweavers

1512 search results - page 72 / 303
» connection 2006
Sort
View
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
14 years 9 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis
IPL
2006
95views more  IPL 2006»
14 years 9 months ago
Smaller superconcentrators of density 28
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Uwe Schöning
62
Voted
IPL
2006
88views more  IPL 2006»
14 years 9 months ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba
IPL
2006
116views more  IPL 2006»
14 years 9 months ago
Guarding galleries and terrains
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
Alon Efrat, Sariel Har-Peled
JCT
2006
81views more  JCT 2006»
14 years 9 months ago
Hyperplane partitions and difference systems of sets
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. This paper gives new constructions of DSS obtained from parti...
Ryoh Fuji-Hara, Akihiro Munemasa, Vladimir D. Tonc...