1172 search results - page 96 / 235 » Constructions of generalized Sidon sets |
298
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
166
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
312
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
188
click to vote
APPROX
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
135
click to vote
SEMWEB
2009
Springer
16 years 28 days ago
2009
Springer
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can significantly improve the quality of the preci...