2430 search results - page 321 / 486 » Computing Tutte Polynomials |
118
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
111
Voted
CIDM
2007
IEEE
15 years 7 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
141
Voted
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
148
Voted
FCT
2007
Springer
15 years 5 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
178
Voted
DCOSS
2008
Springer
15 years 5 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...