68 search results - page 8 / 14 » Grounding with Bounds |
114
click to vote
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
78
Voted
MICCAI
2003
Springer
15 years 10 months ago
2003
Springer
A robust and automatic system has been developed to detect the visual axis and extract important feature landmarks from slit-lamp photographs, and objectively grade the severity of...
71
Voted
ACCV
2006
Springer
15 years 3 months ago
2006
Springer
The need for empirical evaluation metrics and algorithms is well acknowledged in the field of computer vision. The process leads to precise insights to understanding current techn...
102
click to vote
WEBDB
2010
Springer
15 years 2 months ago
2010
Springer
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...