1225 search results - page 37 / 245 » The Instance Complexity Conjecture |
COMBINATORICS
2007
13 years 9 months ago
2007
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
BIBE
2006
IEEE
14 years 3 months ago
2006
IEEE
We show how chemical background knowledge can be used to improve the prediction performance in structureactivitity relationships (SARs) for non-congeneric compounds. The goal of t...
CHES
2010
Springer
13 years 10 months ago
2010
Springer
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
COGSCI
2008
13 years 9 months ago
2008
Griffiths and Tenenbaum (2006) asked individuals to make predictions about the duration or extent of everyday events (e.g., cake baking times), and reported that predictions were ...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— It is natural to envisage that in a telephone network, some telephone numbers originate or receive more calls than others. Indeed, real-life data have verified the conjecture ...