1236 search results - page 65 / 248 » Prefix-Like Complexities and Computability in the Limit |
DIS
2001
Springer
15 years 2 months ago
2001
Springer
Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is someth...
ICNP
1999
IEEE
15 years 2 months ago
1999
IEEE
Forward Error Correction (FEC) has been proposed as a technique for implementing efficient reliable multicast (RM). However, FEC incurs costs in encode/decode delay and implementa...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
177
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
IWINAC
2007
Springer
15 years 4 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...