3317 search results - page 283 / 664 » Strategies in Rigid-Variable Methods |
188
click to vote
ISCI
2008
15 years 6 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
157
click to vote
TCS
2008
15 years 6 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
165
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
The complexity and high construction cost of case bases make it very difficult, if not impossible, to evaluate a CBR system, especially a knowledge-intensive CBR system, using stat...
158
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
Although variational methods are among the most accurate techniques for estimating the optical flow, they have not yet entered the field of real-time vision. Main reason is the gr...
187
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...