Sciweavers

1199 search results - page 156 / 240
» Parameterized Proof Complexity
Sort
View
125
Voted
CASCON
2004
129views Education» more  CASCON 2004»
15 years 2 months ago
Practical language-independent detection of near-miss clones
Previous research shows that most software systems contain significant amounts of duplicated, or cloned, code. Some clones are exact duplicates of each other, while others differ ...
James R. Cordy, Thomas R. Dean, Nikita Synytskyy
FORTE
2004
15 years 2 months ago
A Temporal Logic Based Framework for Intrusion Detection
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...
Prasad Naldurg, Koushik Sen, Prasanna Thati
MMNS
2003
98views Multimedia» more  MMNS 2003»
15 years 2 months ago
Managing Services Quality through Admission Control and Active Monitoring
We propose a lightweight traffic admission control scheme based on on-line monitoring which ensures multimedia services quality both intra-domain and end-to-end. The AC strategy i...
Solange Rito Lima, Paulo Carvalho, Alexandre Santo...
JMLR
2006
134views more  JMLR 2006»
15 years 21 days ago
Considering Cost Asymmetry in Learning Classifiers
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...
Francis R. Bach, David Heckerman, Eric Horvitz
115
Voted
TCOM
2008
68views more  TCOM 2008»
15 years 20 days ago
MPSK modulated constellation design for differential space-time modulation
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
Qinghua Shi, Q. T. Zhang