1983 search results - page 357 / 397 » Competitive graph searches |
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
MIR
2004
ACM
14 years 1 months ago
2004
ACM
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...
WIDM
2004
ACM
14 years 1 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...