432 search results - page 24 / 87 » Open Problems with Part-Whole Relations |
113
Voted
ICDAR
2009
IEEE
14 years 10 months ago
2009
IEEE
: This paper deals with the topic of the retrieval of document images focussed on a specific application : the ornaments of the Hand-Press period. It presents an overview as a resu...
91
Voted
IJKDB
2010
14 years 9 months ago
2010
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
95
Voted
FOSSACS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
82
Voted
ADC
2004
Springer
15 years 5 months ago
2004
Springer
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
103
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...