194 search results - page 22 / 39 » The Polytope of Degree Partitions |
115
click to vote
IVC
2008
14 years 11 months ago
2008
We present a method for efficiently generating a representation of a multi-modal posterior probability distribution. The technique combines ideas from RANSAC and particle filterin...
JCO
2007
14 years 11 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
JAT
2002
14 years 11 months ago
2002
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
105
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
122
click to vote
APCHI
2008
IEEE
15 years 6 months ago
2008
IEEE
Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless...