Sciweavers

3454 search results - page 114 / 691
» Modern computer algebra
Sort
View
168
Voted
DCC
2010
IEEE
15 years 1 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews
ITRUST
2004
Springer
15 years 11 months ago
The Use of Formal Methods in the Analysis of Trust (Position Paper)
Security and trust are two properties of modern computing systems that are the focus of much recent interest. They play an increasingly significant role in the requirements for mo...
Michael J. Butler, Michael Leuschel, Stépha...
ECCV
2004
Springer
16 years 8 months ago
A Unified Algebraic Approach to 2-D and 3-D Motion Segmentation
We present an analytic solution to the problem of estimating multiple 2-D and 3-D motion models from two-view correspondences or optical flow. The key to our approach is to view th...
René Vidal, Yi Ma
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
16 years 3 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
16 years 3 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...