2080 search results - page 298 / 416 » Measuring empirical computational complexity |
220
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a new bilateral filtering algorithm with computational
complexity invariant to filter kernel size, socalled
O(1) or constant time in the literature. By showing
that a...
177
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
283
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
150
click to vote
IPPS
2007
IEEE
16 years 19 days ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
164
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...