9842 search results - page 1352 / 1969 » The Complexity of the Matching-Cut Problem |
208
click to vote
ICAPR
2005
Springer
16 years 23 days ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
212
click to vote
RTA
2005
Springer
16 years 22 days ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
197
click to vote
DIALM
2004
ACM
16 years 20 days ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
176
click to vote
SAC
2004
ACM
16 years 20 days ago
2004
ACM
This paper addresses the problem of “missing requirements” in software requirements specification (SRS) expressed in natural language. Due to rapid changes in technology and b...
225
Voted
AMAI
2004
Springer
16 years 19 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...