1431 search results - page 68 / 287 » The complexity of random ordered structures |
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
177
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
92
Voted
BSL
2000
15 years 12 days ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
111
Voted
DASFAA
2003
IEEE
15 years 5 months ago
2003
IEEE
The increase in the use of XML (eXtensible Markup Language) makes the semistructured data more and more important on the Web. To exploit the full power of XML documents, a query l...
113
Voted
IACR
2011
14 years 6 days ago
2011
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...