5608 search results - page 970 / 1122 » On the Theory of Matchgate Computations |
MLG
2007
Springer
15 years 7 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
102
click to vote
GRAPHITE
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
107
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
151
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
125
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...