10988 search results - page 242 / 2198 » Algorithmic Folding Complexity |
127
Voted
CCS
2004
ACM
15 years 9 months ago
2004
ACM
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
122
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
132
Voted
FAW
2009
Springer
15 years 8 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
156
click to vote
AIMDM
1999
Springer
15 years 8 months ago
1999
Springer
This paper describes an approach to the detection of events in complex, multi-channel, high frequency data. The example used is that of detecting the re-siting of a transcutaneous ...
141
click to vote
ECP
1997
Springer
15 years 8 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...