Sciweavers

1399 search results - page 45 / 280
» Multi-party Finite Computations
Sort
View
FOCS
2004
IEEE
14 years 1 months ago
Measured Descent: A New Embedding Method for Finite Metrics
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
Robert Krauthgamer, James R. Lee, Manor Mendel, As...
ANLP
2000
91views more  ANLP 2000»
13 years 11 months ago
Finite-State Reduplication in One-Level Prosodic Morphology
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
Markus Walther
IMR
2004
Springer
14 years 3 months ago
Finite Element Mesh Sizing for Surfaces Using Skeleton
The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric com...
William Roshan Quadros, Steven J. Owen, Michael L....
SPDP
1991
IEEE
14 years 1 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
PODC
2010
ACM
13 years 12 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya