917 search results - page 34 / 184 » The Generalized Trace-Norm and its Application to Structure-... |
148
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
213
click to vote
ACNS
2003
Springer
15 years 11 months ago
2003
Springer
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
151
click to vote
HPDC
1998
IEEE
15 years 10 months ago
1998
IEEE
One of the most difficult problems to be solved by metacomputing systems is to ensure strong authentication and authorization. The problem is complicated since the hosts involved ...
179
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
154
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...