Sciweavers

793 search results - page 73 / 159
» Efficient computation of the characteristic polynomial
Sort
View
COMMA
2010
13 years 2 months ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...
EWCBR
2006
Springer
13 years 11 months ago
Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation
Abstract. We show how case bases can be compiled into Decision Diagrams, which represent the cases with reduced redundancy. Numerous computations can be performed efficiently on th...
Ross Nicholson, Derek G. Bridge, Nic Wilson
TIT
2008
110views more  TIT 2008»
13 years 7 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
EUROCRYPT
2006
Springer
13 years 11 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
COMPUTING
2007
127views more  COMPUTING 2007»
13 years 7 months ago
Analyzing a generalized Loop subdivision scheme
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
Ingo Ginkel, Georg Umlauf