2322 search results - page 340 / 465 » On a game in directed graphs |
197
click to vote
SPATIALCOGNITION
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we apply a formal ontological framework in order to deconstruct two prominent approaches to navigation from cognitive robotics, the Spatial Semantic Hierarc...
126
click to vote
ICDCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
197
click to vote
ICCPOL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. For casual web users, a natural language is more accessible than formal query languages. However, understanding of a natural language query is not trivial for computer sy...
149
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
154
click to vote
CPM
2001
Springer
15 years 11 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...