201 search results - page 23 / 41 » Spotting Structure in Complex Time Dependent Flow |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
MMNS
2004
14 years 11 months ago
2004
Due to the significant development of network services in the past few years, their validation has become increasingly difficult. The advent of novel approaches to the issue of val...
HICSS
2008
IEEE
14 years 9 months ago
2008
IEEE
We use the OPA complex systems model of the power transmission system to investigate the effect of a series of different network upgrade scenarios on the long time dynamics and th...