2503 search results - page 196 / 501 » A study of 3-arc graphs |
169
click to vote
SIROCCO
2010
15 years 8 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
167
click to vote
TRECVID
2008
15 years 8 months ago
2008
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
163
click to vote
AAAI
1994
15 years 8 months ago
1994
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
174
click to vote
TNN
1998
15 years 6 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
185
click to vote
TCS
2010
15 years 5 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...