9842 search results - page 453 / 1969 » The Complexity of the Matching-Cut Problem |
213
click to vote
AKA
2004
15 years 8 months ago
2004
: Swiss Re has established an architectural framework, tools, and concepts that enable business people to specify their view of the business in a consistent and formal manner. Base...
233
click to vote
NIPS
2004
15 years 8 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
178
click to vote
DBSEC
2000
15 years 8 months ago
2000
Database systems are being more and more used, with larger sized databases, and as components of very complex systems, that include numerous protocols. Database security problems ...
166
click to vote
UAI
1997
15 years 8 months ago
1997
We review the problem of time-critical action and discuss a reformulation that shifts knowledge acquisition from the assessment of complex temporal probabilistic dependencies to t...
185
click to vote
IJCAI
1993
15 years 8 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...