Sciweavers

9997 search results - page 352 / 2000
» The case for crowd computing
Sort
View
JAR
1998
134views more  JAR 1998»
15 years 6 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
ECCV
2000
Springer
16 years 8 months ago
Significantly Different Textures: A Computational Model of Pre-attentive Texture Segmentation
Abstract. Recent human vision research [1] suggests modelling preattentive texture segmentation by taking a set of feature samples from a local region on each side of a hypothesize...
Ruth Rosenholz
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 7 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
STACS
2009
Springer
16 years 1 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...