1120 search results - page 25 / 224 » Making computer science minority-friendly |
105
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
158
click to vote
CAD
2011
Springer
14 years 6 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
GI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract: Logistics processes in a globalised economy are increasingly complex, dynamic, and distributed. These properties pose major challenges for logistics planning and control....
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
IMSCCS
2007
IEEE
15 years 6 months ago
2007
IEEE
TOPSAW program was developed by Dr. S. Chang and his team and has been successfully used in the replication of sawmill cutting to determine the optimal cutting pattern for a log t...