736 search results - page 48 / 148 » Approximating the Number of Network Motifs |
118
click to vote
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Feature extraction is a process that extracts salient features from observed variables. It is considered a promising alternative to overcome the problems of weight and structure o...
TNN
2008
14 years 9 months ago
2008
Previous work on statistical language modeling has shown that it is possible to train a feed-forward neural network to approximate probabilities over sequences of words, resulting...
101
click to vote
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
131
click to vote
APBC
2004
14 years 11 months ago
2004
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...