19866 search results - page 372 / 3974 » Computing all factorizations in *** |
169
click to vote
DAM
2002
15 years 6 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
163
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
172
click to vote
SC
2004
ACM
16 years 7 days ago
2004
ACM
: Legend says that Archimedes remarked, on the discovery of the lever, “Give me a place to stand, and I can move the world.” Today, computing pervades all aspects of science an...
174
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
204
click to vote
CLUSTER
2004
IEEE
15 years 10 months ago
2004
IEEE
Single system image(SSI) systems have been the mainstay of high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a c...