9842 search results - page 313 / 1969 » The Complexity of the Matching-Cut Problem |
119
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
125
click to vote
VMCAI
2005
Springer
15 years 9 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
144
Voted
PODS
2010
ACM
15 years 8 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
128
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
116
Voted
CVPR
2006
IEEE
15 years 9 months ago
2006
IEEE
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...