7930 search results - page 521 / 1586 » Greedy in Approximation Algorithms |
195
click to vote
JOI
2007
15 years 7 months ago
2007
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
222
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
227
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
352
click to vote
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
289
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper constrained Gradient Vector Flow (GVF) field generation is performed, for fast and accurate unsupervised stereoscopic semantic segmentation. The scheme utilizes the ...