5592 search results - page 322 / 1119 » On Random Betweenness Constraints |
220
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
202
click to vote
CIARP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
200
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In a former work of ours [I], we proposed a new way to express and interpret the epipolar constraint using Geometric Algebra, and we derived from it a novel and efficient2view cam...
147
click to vote
ICIP
1997
IEEE
16 years 8 months ago
1997
IEEE
Multi-channel super-resolution is a means of recovering high frequency information by trading off the temporal bandwidth. Almost all the methods proposed in the literature are bas...
147
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...