749 search results - page 120 / 150 » Combinatory Models and Symbolic Computation |
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
SIGGRAPH
2010
ACM
15 years 2 months ago
2010
ACM
This paper introduces a data-driven process for designing and fabricating materials with desired deformation behavior. Our process starts with measuring deformation properties of ...
73
Voted
FOCS
1993
IEEE
15 years 2 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
112
click to vote
STOC
1995
ACM
15 years 1 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...