Sciweavers

973 search results - page 15 / 195
» New Bounds on Crossing Numbers
Sort
View
TCOM
2011
86views more  TCOM 2011»
13 years 2 months ago
New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation
—We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary antipodal signature sets for any number of signatures K and any signature length L. Opti...
Harish Ganapathy, Dimitrios A. Pados, George N. Ka...
ESA
1998
Springer
95views Algorithms» more  ESA 1998»
13 years 11 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
JAL
2000
82views more  JAL 2000»
13 years 7 months ago
New Upper Bounds for Maximum Satisfiability
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
Rolf Niedermeier, Peter Rossmanith
COLT
2000
Springer
13 years 11 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
AMC
2010
126views more  AMC 2010»
13 years 7 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos