Sciweavers

8512 search results - page 131 / 1703
» Computing Theory With Relevance
Sort
View
JCP
2007
104views more  JCP 2007»
13 years 8 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
DAGSTUHL
2007
13 years 9 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
14 years 3 months ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
CP
2005
Springer
14 years 1 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
DNA
2005
Springer
144views Bioinformatics» more  DNA 2005»
14 years 1 months ago
Designing Nucleotide Sequences for Computation: A Survey of Constraints
We survey the biochemical constraints useful for the design of DNA code words for DNA computation. We define the DNA/RNA Code Constraint problem and cover biochemistry topics rel...
Jennifer A. Sager, Darko Stefanovic