1379 search results - page 198 / 276 » The Complexity of the Annihilating Polynomial |
270
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
146
click to vote
ESORICS
2006
Springer
15 years 10 months ago
2006
Springer
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
158
click to vote
AAAI
2007
15 years 8 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
177
click to vote
AAAI
2007
15 years 8 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
162
click to vote
NIPS
2007
15 years 7 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....