229 search results - page 13 / 46 » On the Number of Arrangements of Pseudolines |
ANSS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
GD
2004
Springer
14 years 1 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
DBISP2P
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Interest-based communities are a natural arrangement of distributed systems that prune the search space and allow for better dissemination of information to participating...
COMPGEOM
2000
ACM
14 years 5 days ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
ETRA
2000
ACM
14 years 5 days ago
2000
ACM
Text input with eye trackers can be implemented in many ways such as on-screen keyboards or context sensitive menu-selection techniques. We propose the use of off-screen targets a...