3875 search results - page 592 / 775 » Approximation algorithms for the 0-extension problem |
144
click to vote
COCOON
2007
Springer
16 years 21 days ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
149
click to vote
ISAAC
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
168
click to vote
ISNN
2007
Springer
16 years 20 days ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
199
click to vote
ICDM
2006
IEEE
16 years 17 days ago
2006
IEEE
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
169
click to vote
FM
2005
Springer
16 years 1 days ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...