2370 search results - page 240 / 474 » The Characterization of Data-Accumulating Algorithms |
121
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
146
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
132
click to vote
DAM
2008
15 years 4 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
149
click to vote
AROBOTS
2006
15 years 4 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
133
click to vote
JMLR
2008
15 years 4 months ago
2008
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...