Sciweavers

217 search results - page 9 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
RTAS
2003
IEEE
14 years 22 days ago
A Cyclic-Executive-Based QoS Guarantee over USB
Universal Serial Bus (USB) is a popular standard for PC peripheral devices because of its versatile peripheral interconnection specifications. USB not only provides simplified h...
Chih-Yuan Huang, Li-Pin Chang, Tei-Wei Kuo
JGAA
2007
104views more  JGAA 2007»
13 years 7 months ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
COMPGEOM
2005
ACM
13 years 9 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
13 years 11 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson