FUN
2007
Springer
14 years 1 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
FUN
2007
Springer
14 years 1 months ago
2007
Springer
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
FUN
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
DAARC
2009
Springer
14 years 1 months ago
2009
Springer
We discuss an unusual reflexive construction in which the Chinese reflexive ziji appears twice, once before the verb and once after. We demonstrate that this is a distinct construc...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
ESCAPE
2007
Springer
14 years 1 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...