Sciweavers

13603 search results - page 237 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
15 years 4 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»
15 years 4 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...
ICALP
2010
Springer
15 years 8 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
FDL
2004
IEEE
15 years 10 months ago
A Functional Programming Framework of Heterogeneous Model of Computation for System Design
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
Deepak Mathaikutty, Hiren D. Patel, Sandeep K. Shu...
DAGSTUHL
2007
15 years 8 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis