Sciweavers

19866 search results - page 252 / 3974
» Computing all factorizations in ***
Sort
View
155
Voted
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
DATE
1997
IEEE
75views Hardware» more  DATE 1997»
15 years 11 months ago
Using constraint logic programming in memory synthesis for general purpose computers
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
Renate Beckmann, Jürgen Herrmann
DICTA
2003
15 years 8 months ago
TLIB: A Real-time Computer Vision Library for HCI
A computer vision software library is a key component of vision-based applications. While there are several existing libraries, most are large and comple or limited to a particular...
Sébastien Grange, Terry Fong, Charles Baur
SOSP
1997
ACM
15 years 8 months ago
Automated Hoarding for Mobile Computers
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
Geoffrey H. Kuenning, Gerald J. Popek
COMPLEXITY
2007
104views more  COMPLEXITY 2007»
15 years 6 months ago
What is the complexity of a distributed computing system?
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
Anand Ranganathan, Roy H. Campbell