3913 search results - page 270 / 783 » complexity 2006 |
163
Voted
EJC
2006
15 years 6 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
180
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces o...
173
click to vote
FGCS
2007
15 years 6 months ago
2007
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
130
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
A fast rate-distortion analytical framework for the PSNR-based optimization of JPEG baseline compression on color images is proposed in this paper. The analysis is conducted in th...
140
Voted
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...