2654 search results - page 80 / 531 » On Pairing Inversion Problems |
122
click to vote
SIAMDM
2008
15 years 4 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
125
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Reaching is a critical task for humanoid robots, requiring the application of state-of-the-art algorithms for motion planning and inverse kinematics. Practical algorithms for s...
144
click to vote
IDA
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we introduce three alternative combinatorial formulations of the theory of evidence (ToE), by proving that both plausibility and commonality functions share the stru...
157
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We address the problem of blind source separation in the underdetermined and instantaneous mixture case. The proposed method is based on an algorithm developed by Aissa-El-Bey and...
125
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...