4041 search results - page 123 / 809 » time 2009 |
152
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
165
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes early experiments, which attempt to reconfigure the sound of a breath using a network of artificial spiking cortical neurons. The connectivity of the network e...
164
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
143
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
158
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...