9842 search results - page 364 / 1969 » The Complexity of the Matching-Cut Problem |
244
click to vote
GIS
2004
ACM
16 years 5 months ago
2004
ACM
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
142
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
165
click to vote
LISA
2008
15 years 6 months ago
2008
Application problem diagnosis in complex enterprise environments is a challenging problem, and contributes significantly to the growth in IT management costs. While application pr...
132
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
143
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...