1278 search results - page 235 / 256 » The Complexity of Weighted Boolean |
WADS
2007
Springer
14 years 4 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
SAB
2004
Springer
14 years 3 months ago
2004
Springer
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
ASUNAM
2010
IEEE
13 years 11 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
ESANN
2008
13 years 11 months ago
2008
While it is well-known that model can enhance the control performance in terms of precision or energy efficiency, the practical application has often been limited by the complexiti...
BMCBI
2010
13 years 10 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...