219 search results - page 20 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
108
click to vote
JACM
2008
15 years 1 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
111
click to vote
ICALP
2009
Springer
15 years 8 months ago
2009
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
100
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
102
click to vote
SODA
2010
ACM
15 years 11 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...
103
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...