4378 search results - page 204 / 876 » On the Complexity of Ordered Colourings |
216
click to vote
ML
2000
ACM
15 years 6 months ago
2000
ACM
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
191
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--Domain knowledge for web applications is currently being made available as domain ontology with the advent of the semantic web, in which semantics govern relationships am...
150
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
153
click to vote
SRDS
1999
IEEE
15 years 11 months ago
1999
IEEE
Validating distributed systems is particularly difficult, since failures may occur due to a correlated occurrence of faults in different parts of the system. This paper describes ...
185
click to vote
TAMC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...