Sciweavers

446 search results - page 23 / 90
» Extremal Stable Graphs
Sort
View
ISBI
2004
IEEE
14 years 9 months ago
Local Feature Matching Using Entropic Graphs
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson...
AAAI
2007
13 years 10 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
NIPS
1996
13 years 9 months ago
Are Hopfield Networks Faster than Conventional Computers?
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
Ian Parberry, Hung-Li Tseng
HYBRID
2007
Springer
14 years 10 days ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
ASP
2003
Springer
14 years 1 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch