466 search results - page 49 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
170
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
154
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Fusing partial estimates is a critical and common problem
in many computer vision tasks such as part-based detection
and tracking. It generally becomes complicated and
intractab...
181
click to vote
ICAPR
2001
Springer
15 years 10 months ago
2001
Springer
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
164
click to vote
CSMR
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a technique for recovering the high level design of legacy software systems according to user defined architectural plans. Architectural plans are represented...
137
click to vote
ICCAD
1993
IEEE
15 years 10 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...