Sciweavers

326 search results - page 57 / 66
» Closing the Gap
Sort
View
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
15 years 4 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin
FOCS
2006
IEEE
15 years 4 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
KBSE
2005
IEEE
15 years 3 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 2 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
ATAL
2000
Springer
15 years 2 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...