Sciweavers

13603 search results - page 111 / 2721
» On the Complexity of Computing Treelength
Sort
View
IBERAMIA
2010
Springer
13 years 7 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
TOG
2010
129views more  TOG 2010»
13 years 4 months ago
Optical computing for fast light transport analysis
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
Matthew O'Toole, Kiriakos N. Kutulakos
SIGCSE
2002
ACM
128views Education» more  SIGCSE 2002»
13 years 9 months ago
Enhancing the quality of learning and understanding of first-year mathematics for computer science related majors
Most courses on Discrete Mathematics are designed to emphasize problem solving, in general. When the goal is to cover the content, the learning and understanding takes a second pl...
Francis Suraweera
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
IJDMB
2010
128views more  IJDMB 2010»
13 years 6 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...