4940 search results - page 156 / 988 » On the Complexity of Universal Programs |
140
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
145
click to vote
CCS
2007
ACM
15 years 11 months ago
2007
ACM
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
145
click to vote
AMAST
2008
Springer
15 years 7 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
189
click to vote
CCGRID
2010
IEEE
15 years 6 months ago
2010
IEEE
Geo-sciences involve large-scale parallel models, high resolution real time data from highly asynchronous and heterogeneous sensor networks and instruments, and complex analysis a...
122
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...