7055 search results - page 119 / 1411 » Some New 4-Designs |
190
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
167
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
212
click to vote
CN
2011
14 years 10 months ago
2011
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
165
click to vote
IPL
2008
15 years 6 months ago
2008
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
192
click to vote
LREC
2010
15 years 4 months ago
2010
In this paper we discuss some well-known morphological descriptions used in various projects and applications (most notably MULTEXT-East and Unitex) and illustrate the encountered...