564 search results - page 72 / 113 » Approximation algorithms for restricted Bayesian network str... |
139
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
105
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
In complex multi-agent fusion systems resource conflicts are very likely to occur. We propose an algorithm that determines the optimal sensing resource to fusion task assignment,...
146
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
169
Voted
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
180
Voted
STRINGOLOGY
2004
15 years 6 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...