Sciweavers

6833 search results - page 1163 / 1367
» Some two-character sets
Sort
View
CCGRID
2001
IEEE
15 years 10 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin
EUROCRYPT
2000
Springer
15 years 10 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
FOCS
2000
IEEE
15 years 10 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
ALT
1995
Springer
15 years 10 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ICCBR
1995
Springer
15 years 10 months ago
Route Planning by Analogy
There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include in...
Karen Zita Haigh, Manuela M. Veloso
« Prev « First page 1163 / 1367 Last » Next »