IPL
2007
13 years 5 months ago
2007
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
IPL
2007
13 years 5 months ago
2007
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled determinist...
IPL
2007
13 years 5 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
IPL
2007
13 years 5 months ago
2007
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where H...
IPL
2007
13 years 5 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
IPL
2007
13 years 5 months ago
2007
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
IPL
2007
13 years 5 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
IPL
2007
13 years 5 months ago
2007
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
IPL
2007
13 years 5 months ago
2007
There are two popular approaches to specifying the semantics of process algebras: labelled transition semantics and reaction semantics. While the notion of free name is rather unp...
IPL
2007
13 years 5 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...