5608 search results - page 831 / 1122 » On the Theory of Matchgate Computations |
170
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
183
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
178
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
183
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
180
click to vote
CHI
1995
ACM
15 years 10 months ago
1995
ACM
As spoken language interfaces for real-world systems become a practical possibility, it has become apparent that such interfaces will need to draw on a variety of cues from divers...