5183 search results - page 345 / 1037 » The Complexity of Distributions |
175
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
178
click to vote
ACL
1994
15 years 8 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
205
click to vote
CSI
2007
15 years 6 months ago
2007
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
209
click to vote
DEBS
2007
ACM
15 years 8 months ago
2007
ACM
This paper describes an approach to detect unknown event patterns. In this context, an event is not only something that happens, but also something that can be analysed. This task...
161
click to vote
ICDCSW
2006
IEEE
16 years 23 days ago
2006
IEEE
Software systems need to adapt as requirements change, environment conditions vary, and bugs are discovered and fixed. In context of verification of these adaptive systems, the ...