99 search results - page 3 / 20 » On a subclass of close-to-convex functions |
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
SETA
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we start developing a detailed theory of nega– Hadamard transforms. Consequently, we derive several results on negabentness of concatenations, and partially-symmetr...
FSE
2003
Springer
14 years 3 months ago
2003
Springer
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
DAWAK
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...