96 search results - page 17 / 20 » Restructuring ordered binary trees |
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
BMCBI
2008
14 years 9 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
108
click to vote
PR
2007
14 years 9 months ago
2007
In this work, we are interested in technologies that will allow users to actively browse and navigate large image databases and to retrieve images through interactive fast browsin...
CHES
2005
Springer
15 years 3 months ago
2005
Springer
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...