IDA
2008
Springer
13 years 8 months ago
2008
Springer
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
EMISA
2008
Springer
13 years 8 months ago
2008
Springer
EJC
2008
13 years 8 months ago
2008
EJC
2008
13 years 8 months ago
2008
EJC
2008
13 years 8 months ago
2008
We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improv...
EJC
2008
13 years 8 months ago
2008
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
EJC
2008
13 years 8 months ago
2008
Abstract. In this paper we enumerate the number of ways of selecting k objects from n objects arrayed in a line such that no two selected ones are separated by m-1, 2m-1,
EJC
2008
13 years 8 months ago
2008
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
EJC
2008
13 years 8 months ago
2008
EJC
2008
13 years 8 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...