Sciweavers

CA
1996
IEEE
14 years 3 months ago
Efficient And Accurate Interference Detection For Polynomial Deformation
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
Merlin Hughes, Christopher DiMattia, Ming C. Lin, ...
AAECC
1997
Springer
99views Algorithms» more  AAECC 1997»
14 years 3 months ago
Extension Theorems for Linear Codes over Finite Rings
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
Jay A. Wood
AAECC
1997
Springer
113views Algorithms» more  AAECC 1997»
14 years 3 months ago
Order Functions and Evaluation Codes
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geo...
Tom Høholdt, Jacobus H. van Lint, Ruud Pell...
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
14 years 3 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
Laurent Bernardin, Michael B. Monagan
AAECC
1997
Springer
100views Algorithms» more  AAECC 1997»
14 years 3 months ago
Yet Another Ideal Decomposition Algorithm
Massimo Caboara, Pasqualina Conti, Carlo Traverso
AADEBUG
1997
Springer
14 years 3 months ago
Observation and Control for Debugging Distributed Computations
I present a general framework for observing and controlling a distributed computation and its applications to distributed debugging. Algorithms for observation are useful in distr...
Vijay K. Garg
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
14 years 3 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
Itzhak Parnafes, Ran Raz, Avi Wigderson
STOC
1997
ACM
131views Algorithms» more  STOC 1997»
14 years 3 months ago
Byzantine Quorum Systems
Dahlia Malkhi, Michael K. Reiter
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
14 years 3 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
STOC
1997
ACM
88views Algorithms» more  STOC 1997»
14 years 3 months ago
Spectral Techniques for Expander Codes
John D. Lafferty, Daniel N. Rockmore