2165 search results - page 59 / 433 » cases 2005 |
134
click to vote
SIBGRAPI
2005
IEEE
15 years 9 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
144
Voted
QOSIP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
131
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
In the case of one-dimensional filter banks, symmetric extension is a commonly used technique for constructing nonexpansive transforms of finite-length sequences. In this paper, w...
132
Voted
CBMS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we present our spreadsheet framework, which uses a spreadsheet-like interface for exploring biomedical datasets. The principles and advantages of this class of visu...