Sciweavers

692 search results - page 46 / 139
» Some research questions for computational transportation sci...
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
CHARME
2001
Springer
133views Hardware» more  CHARME 2001»
15 years 2 months ago
View from the Fringe of the Fringe
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
Steven D. Johnson
ACSC
2005
IEEE
15 years 3 months ago
Integer Programming Models and Algorithms for Molecular Classification of Cancer from Microarray Data
Novel, high-throughput technologies are challenging the core of algorithmic methods available in Computer Science. Microarray technologies give Life Sciences researchers the oppor...
Regina Berretta, Alexandre Mendes, Pablo Moscato
CSR
2008
Springer
14 years 11 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
ITCC
2000
IEEE
15 years 2 months ago
Parallel Real-Time Numerical Computation: Beyond Speedup III
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...
Selim G. Akl, Stefan D. Bruda