Search Sciweavers | Sciweavers

1089 search results - page 3 / 218

» Bounds on generalized Frobenius numbers

click to vote

CORR
2006
Springer

78views Education» more CORR 2006»

On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory

13 years 6 months ago

Download moser.cm.nctu.edu.tw

We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and ...

Stefan M. Moser

claim paper

Read More »

click to vote

COMGEO
2004
ACM

110views Applied Computing» more COMGEO 2004»

A lower bound on the number of triangulations of planar point sets

13 years 6 months ago

Download www.ist.tugraz.at

We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...

Oswin Aichholzer, Ferran Hurtado, Marc Noy

claim paper

Read More »

click to vote

LION
2009
Springer

125views Optimization» more LION 2009»

New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory

14 years 24 days ago

Download lion.disi.unitn.it

This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a speciﬁc class of h...

Samuel Rota Bulò, Marcello Pelillo

claim paper

Read More »

click to vote

DM
2000

158views more DM 2000»

Bipartite Ramsey numbers and Zarankiewicz numbers

13 years 6 months ago

Download www.cs.clemson.edu

The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...

Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...

claim paper

Read More »

click to vote

DCG
2006

96views more DCG 2006»

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn

13 years 6 months ago