1554 search results - page 168 / 311 » Parameterized Complexity and Approximation Algorithms |
108
click to vote
FORTE
2004
15 years 4 months ago
2004
Abstract. We propose a framework for intrusion detection that is based on runtime monitoring of temporal logic specifications. We specify intrusion patterns as formulas in an expre...
144
click to vote
JMLR
2006
15 years 3 months ago
2006
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
231
click to vote
DISOPT
2011
14 years 10 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
123
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
130
Voted
SIP
2003
15 years 4 months ago
2003
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...