903 search results - page 72 / 181 » Non-well-founded trees in categories |
146
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a method for simultaneous detection, localization and segmentation of objects of a known category. We show that this is possible by using segments as features. To this ...
174
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
160
click to vote
PPPJ
2009
ACM
16 years 1 months ago
2009
ACM
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
143
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
171
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Development of robust and efficient methods for analyzing and interpreting high dimension gene expression profiles continues to be a focus in computational biology. Th...