Sciweavers

1648 search results - page 66 / 330
» Where to Build a Door
Sort
View
DAM
2010
60views more  DAM 2010»
13 years 10 months ago
One-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Yonghong Xiang, Iain A. Stewart
IPL
2006
95views more  IPL 2006»
13 years 9 months ago
Smaller superconcentrators of density 28
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Uwe Schöning
TCS
2008
13 years 9 months ago
Spatial-behavioral types for concurrency and resource control in distributed systems
We develop a notion of spatial-behavioral typing suitable to discipline concurrent interactions and resource usage in distributed object systems. Our type structure reflects a res...
Luís Caires
COLING
2002
13 years 9 months ago
An Inference-based Approach to Dialogue System Design
We present an architecture for spoken dialogue systems where first-order inference (both theorem proving and model building) plays a crucial role in interpreting utterances of dia...
Johan Bos, Tetsushi Oka
SIAMDM
2010
146views more  SIAMDM 2010»
13 years 8 months ago
Bringing Toric Codes to the Next Dimension
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
Ivan Soprunov, Jenya Soprunova