Sciweavers

123 search results - page 22 / 25
» Argument graphs and assumption-based argumentation
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
FCT
2005
Springer
14 years 3 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
CGO
2004
IEEE
14 years 1 months ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...
LREC
2010
179views Education» more  LREC 2010»
13 years 11 months ago
Building a Bank of Semantically Encoded Narratives
We propose a methodology for a novel type of discourse annotation whose model is tuned to the analysis of a text as narrative. This is intended to be the basis of a "story ba...
David K. Elson, Kathleen McKeown
EWC
2000
97views more  EWC 2000»
13 years 9 months ago
Improving the Rationale Capture Capability of QFD
The goals of Design Rationale Capture (DRC) are improving design quality and reducing design time. These general goals have led to the design of many DRC techniques originating fro...
Yoram Reich