Sciweavers

845 search results - page 137 / 169
» Connecting Many-Sorted Theories
Sort
View
EUROCRYPT
2008
Springer
13 years 10 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
ACMIDC
2008
13 years 10 months ago
Playing with the sound maker: do embodied metaphors help children learn?
In this paper we present the results of a comparative study that explores the potential benefits of using embodied ion to help children, aged 7 to 10, learn abstract concepts rela...
Alissa Nicole Antle, Milena Droumeva, Greg Corness
IJCAI
2007
13 years 10 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
13 years 10 months ago
Large-Scale Many-Class Learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Michael Connor
NIPS
2007
13 years 10 months ago
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
Jieping Ye, Zheng Zhao, Mingrui Wu