1221 search results - page 110 / 245 » Two Consistency Results on Set Mappings |
172
click to vote
ACG
2006
Springer
16 years 9 days ago
2006
Springer
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
144
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
163
click to vote
JMIV
2008
15 years 6 months ago
2008
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
182
click to vote
SUM
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
177
click to vote
WADS
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...