Sciweavers

874 search results - page 85 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 13 days ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
IEEEPACT
2000
IEEE
15 years 10 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson
KR
2010
Springer
15 years 11 months ago
Distributed Nonmonotonic Multi-Context Systems
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
FAC
2000
94views more  FAC 2000»
15 years 6 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
COMGEO
2008
ACM
15 years 6 months ago
Recursive geometry of the flow complex and topology of the flow complex filtration
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...