409 search results - page 60 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
117
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...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
MOBIHOC
2010
ACM
14 years 7 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
89
Voted
RTSS
1992
IEEE
15 years 1 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
ISBI
2011
IEEE
14 years 1 months ago
2011
IEEE
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...