Sciweavers

973 search results - page 26 / 195
» New Bounds on Crossing Numbers
Sort
View
ARITH
2005
IEEE
14 years 4 months ago
Arithmetic Operations in the Polynomial Modular Number System
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
Jean-Claude Bajard, Laurent Imbert, Thomas Plantar...
DM
2008
177views more  DM 2008»
13 years 11 months ago
The independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
TPDS
2010
87views more  TPDS 2010»
13 years 9 months ago
An ISP-Friendly File Distribution Protocol: Analysis, Design, and Implementation
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
Minghong Lin, John C. S. Lui, Dah-Ming Chiu
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
13 years 10 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
JCT
2010
112views more  JCT 2010»
13 years 9 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher