9842 search results - page 1411 / 1969 » The Complexity of the Matching-Cut Problem |
195
click to vote
CIKM
2005
Springer
16 years 21 days ago
2005
Springer
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
195
click to vote
COCOON
2005
Springer
16 years 21 days ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
179
click to vote
CP
2005
Springer
16 years 21 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
213
click to vote
PCM
2005
Springer
16 years 19 days ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
219
click to vote
CASES
2004
ACM
16 years 18 days ago
2004
ACM
Recognizing speech, gestures, and visual features are important interface capabilities for future embedded mobile systems. Unfortunately, the real-time performance requirements of...