6598 search results - page 282 / 1320 » Graph Theory with Applications |
143
click to vote
IJCAI
1989
15 years 7 months ago
1989
Model-based revision of knowledge bases ex pressed as first-order theories was shown in [Winslett 88b] to be useful as a means of de scribing and reasoning about the effects o...
205
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
173
click to vote
SPAA
2005
ACM
16 years 4 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
157
click to vote
PODC
2004
ACM
16 years 22 hour ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
264
click to vote
PAMI
2006
15 years 6 months ago
2006
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...