1477 search results - page 12 / 296 » Complexity of (iterated) dominance |
126
click to vote
JCIT
2008
15 years 6 months ago
2008
In this paper we deal with the Landau-LifshitzGilbert equation which describes dynamics of ferromagnetism. Based on the strong nonlinearities a stabilised discretisation method is...
182
click to vote
CRV
2005
IEEE
15 years 11 months ago
2005
IEEE
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
157
click to vote
FSTTCS
2009
Springer
16 years 18 days ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
186
click to vote
TPDS
2002
15 years 5 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
170
click to vote
JCIT
2008
15 years 6 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...