Sciweavers

2316 search results - page 93 / 464
» The many forms of hypercomputation
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Learning Markov logic network structure via hypergraph lifting
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
Stanley Kok, Pedro Domingos
ICML
2002
IEEE
16 years 5 months ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...
CP
2009
Springer
16 years 5 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
ESORICS
2009
Springer
16 years 5 months ago
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption
In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new parad...
Rakeshbabu Bobba, Himanshu Khurana, Manoj Prabhaka...
HPCA
2005
IEEE
16 years 4 months ago
Scatter-Add in Data Parallel Architectures
Many important applications exhibit large amounts of data parallelism, and modern computer systems are designed to take advantage of it. While much of the computation in the multi...
Jung Ho Ahn, Mattan Erez, William J. Dally