194 search results - page 36 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
134
Voted
ICDCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
100
Voted
MOBIHOC
2006
ACM
16 years 1 days ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
126
Voted
FOCM
2008
15 years 15 days ago
2008
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
137
Voted
ACCV
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
117
click to vote
APPROX
2011
Springer
14 years 13 days ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...