9842 search results - page 383 / 1969 » The Complexity of the Matching-Cut Problem |
174
click to vote
NIPS
2004
15 years 5 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
129
click to vote
IJCAI
2003
15 years 5 months ago
2003
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
114
click to vote
UAI
2004
15 years 5 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
119
click to vote
ANOR
2008
15 years 4 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
134
click to vote
ENTCS
2006
15 years 4 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...