3874 search results - page 355 / 775 » Approximation Algorithms for k-hurdle Problems |
170
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
184
click to vote
JMLR
2010
15 years 25 days ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
168
click to vote
KSEM
2009
Springer
16 years 18 days ago
2009
Springer
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
265
click to vote
GECCO
2007
Springer
16 years 6 days ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
157
click to vote
JUCS
2002
15 years 5 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...