Sciweavers

2976 search results - page 346 / 596
» On the bounded integer programming
Sort
View
IS
2008
15 years 4 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
CPC
2007
95views more  CPC 2007»
15 years 4 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald
JCO
2006
96views more  JCO 2006»
15 years 4 months ago
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang...
ECCC
2007
71views more  ECCC 2007»
15 years 4 months ago
Inverse Conjecture for the Gowers norm is false
Let p be a fixed prime number, and N be a large integer. The ’Inverse Conjecture for the Gowers norm’ states that if the ”d-th Gowers norm” of a function f : FN p → F i...
Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
SIAMDM
2008
97views more  SIAMDM 2008»
15 years 4 months ago
Disjoint Color-Avoiding Triangles
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
Raphael Yuster