Sciweavers

411 search results - page 72 / 83
» Algebraic Imperative Specifications
Sort
View
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
15 years 3 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ACSW
2006
15 years 3 months ago
A method for access authorisation through delegation networks
Owners of systems and resources usually want to control who can access them. This must be based on having a process for authorising certain parties, combined with mechanisms for e...
Audun Jøsang, Dieter Gollmann, Richard Au
CSC
2006
15 years 3 months ago
Applying Sparse Matrix Solvers to a Glacial Ice Sheet Model
- Two software packages for solving sparse systems of linear equations, SuperLU and UMFPACK, have been integrated with the University of Maine Ice Sheet Model for predicting the fo...
Rodney Jacobs, James Fastook, Aitbala Sargent
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 3 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 2 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev