736 search results - page 20 / 148 » Approximating the Number of Network Motifs |
ADHOCNOW
2008
Springer
15 years 4 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
UAI
1998
14 years 11 months ago
1998
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a method that combines Mutual Information and k-Nearest Neighbors approximator for time series prediction. Mutual Information is used for input selection. K-Nea...
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
GRID
2003
Springer
15 years 3 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...