486 search results - page 62 / 98 » Improved upper bounds for 3-SAT |
JGT
2008
13 years 8 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
COMGEO
2011
ACM
13 years 3 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
Frame (upper and lower) bound ratio is a key factor of numerical stability of frame systems. While tight frames, of which the minimal ratio 1 is achieved, are much preferred in ma...
WASA
2009
Springer
14 years 3 months ago
2009
Springer
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore hi...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...