Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CATS
1998
11 years 6 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
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...
Weifa Liang, George Havas
CATS
2006
11 years 6 months ago
Learnability of Term Rewrite Systems from Positive Examples
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...
M. R. K. Krishna Rao
CATS
2006
11 years 6 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
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...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
CATS
2006
11 years 6 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
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...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
CATS
2006
11 years 6 months ago
Boolean equation solving as graph traversal
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 ...
Brian Herlihy, Peter Schachte, Harald Sønde...
CATS
2006
11 years 6 months ago
On-demand Bounded Broadcast Scheduling with Tight Deadlines
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 ...
Chung Keung Poon, Feifeng Zheng, Yinfeng Xu
CATS
2006
11 years 6 months ago
Combinatorial Generation by Fusing Loopless Algorithms
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...
Tadao Takaoka, Stephen Violich
CATS
2006
11 years 6 months ago
On the Logical Implication of Multivalued Dependencies with Null Values
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...
Sebastian Link
books