Sciweavers

2095 search results - page 35 / 419
» Improved pebbling bounds
Sort
View
DCC
2010
IEEE
13 years 10 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Multi-directional Width-Bounded Geometric Separator and Protein Folding
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
14 years 3 months ago
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
TCS
2008
13 years 9 months ago
On the bandwidth of 3-dimensional Hamming graphs
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
J. Balogh, Sergei L. Bezrukov, L. H. Harper, &Aacu...
AIPS
2006
13 years 11 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith