7106 search results - page 308 / 1422 » Restricted Complexity, General Complexity |
122
Voted
ALT
1999
Springer
15 years 9 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
127
click to vote
SIGMOD
1996
ACM
15 years 8 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
206
Voted
AII
1992
15 years 8 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
161
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
140
click to vote
CLIMA
2007
15 years 6 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...