1047 search results - page 30 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
—We provide a novel search technique which uses a hierarchical model and a mutual information gain heuristic to efficiently prune the search space when localizing faces in images...
131
click to vote
TCSV
2010
14 years 6 months ago
2010
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
130
click to vote
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
MVA
1998
15 years 1 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...