Sciweavers

1487 search results - page 46 / 298
» The Computational Complexity of Link Building
Sort
View
SCN
2010
Springer
129views Communications» more  SCN 2010»
13 years 6 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
CMSB
2009
Springer
14 years 3 months ago
Computing Reachable States for Nonlinear Biological Models
Abstract. In this paper we describe reachability computation for continuous and hybrid systems and its potential contribution to the process of building and debugging biological mo...
Thao Dang, Colas Le Guernic, Oded Maler
CSE
2009
IEEE
13 years 11 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum
SIGCOMM
2006
ACM
14 years 2 months ago
Jigsaw: solving the puzzle of enterprise 802.11 analysis
The combination of unlicensed spectrum, cheap wireless interfaces and the inherent convenience of untethered computing have made 802.11-based networks ubiquitous in the enterprise...
Yu-Chung Cheng, John Bellardo, Péter Benk&o...
OOPSLA
2009
Springer
14 years 1 months ago
Agile anthropology and Alexander's architecture: an essay in three voices
During its formative decades the software community looked twice to the theories of ChristopherAlexander for inspiration, both times failing to completely master the architect’s...
Jenny Quillien, Pam Rostal, Dave West