9842 search results - page 456 / 1969 » The Complexity of the Matching-Cut Problem |
161
click to vote
TSMC
2008
15 years 7 months ago
2008
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
218
click to vote
DAM
2002
15 years 7 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
219
click to vote
ML
2000
ACM
15 years 7 months ago
2000
ACM
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
162
click to vote
PRL
2002
15 years 7 months ago
2002
Pattern detection problems require a separation between two classes, Target and Clutter, where the probability of the former is substantially smaller compared to that of the latte...
152
click to vote
NAACL
2010
15 years 5 months ago
2010
We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is a...