2340 search results - page 167 / 468 » Copying and Comparing: Problems and Solutions |
161
click to vote
EVOW
2007
Springer
16 years 17 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
144
click to vote
RTSS
2005
IEEE
16 years 1 hour ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
190
click to vote
JMLR
2010
15 years 4 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
200
click to vote
CORR
2011
Springer
15 years 28 days ago
2011
Springer
— We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally corre...
174
click to vote
JODS
2008
15 years 6 months ago
2008
This paper proposes a cooperative approach for composite ontology mapping. We first present an extended classification of automated ontology matching and propose an automatic compo...