Sciweavers

13306 search results - page 476 / 2662
» Theoretical Computer Science
Sort
View
FOCS
2007
IEEE
16 years 2 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
193
Voted
ACMSE
2006
ACM
16 years 1 months ago
Extensions to and optimization of a mobile computational system for internet programming
elow are abstracts of student-faculty collaborative work presented at regional, national, and international conferences. Gregory Adkins, Elizabeth Carter, Amanda Micai, and Sarah M...
Sarah Monisha Pulimood, Gregory Adkins, Elizabeth ...
RANDOM
1998
Springer
15 years 12 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
FOCS
1994
IEEE
15 years 12 months ago
Scheduling Multithreaded Computations by Work Stealing
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
Robert D. Blumofe
ACSC
2005
IEEE
16 years 1 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