Join Our Newsletter

CATS

1998

11 years 6 months ago
1998

Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...

CATS

1998

11 years 6 months ago
1998

CATS

2006

11 years 6 months ago
2006

Learning from examples is an important characteristic feature of intelligence in both natural and artificial intelligent agents. In this paper, we study learnability of term rewri...

CATS

2006

11 years 6 months ago
2006

We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...

CATS

2006

11 years 6 months ago
2006

We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...

CATS

2006

11 years 6 months ago
2006

We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...

CATS

2006

11 years 6 months ago
2006

We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...

CATS

2006

11 years 6 months ago
2006

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to pr...

CATS

2006

11 years 6 months ago
2006

CATS

2006

11 years 6 months ago
2006

The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...