903 search results - page 68 / 181 » Non-well-founded trees in categories |
136
click to vote
DAGSTUHL
1994
15 years 7 months ago
1994
Functionality-based recognition systems recognize objects at the category level by reasoning about how well the objects support the expected function. Such systems naturally assoc...
169
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
200
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper presents a framework for image parsing with multiple label sets. For example, we may want to simultaneously label every image region according to its basiclevel object ...
165
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
148
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...