10988 search results - page 271 / 2198 » Algorithmic Folding Complexity |
139
click to vote
ALT
2002
Springer
16 years 1 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
128
click to vote
SIGIR
2006
ACM
15 years 10 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
132
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
121
click to vote
GIS
1995
ACM
15 years 7 months ago
1995
ACM
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
140
click to vote
IJCAI
2001
15 years 5 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...