ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
Most of the recent works on algorithmic mechanism design exploit the solution concept of dominant strategy equilibria. Such work designs a proper payment scheme so that selfish ag...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...