88 search results - page 8 / 18 » On Graph Powers for Leaf-Labeled Trees |
AGTIVE
2003
Springer
14 years 22 days ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
MSN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...