Sciweavers

6598 search results - page 1044 / 1320
» Graph Theory with Applications
Sort
View
192
Voted
DIM
2007
ACM
15 years 10 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 10 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
FCCM
2004
IEEE
133views VLSI» more  FCCM 2004»
15 years 10 months ago
A Methodology for Synthesis of Efficient Intrusion Detection Systems on FPGAs
Intrusion detection for network security is a computation intensive application demanding high system performance. System level design, a relatively unexplored field in this area,...
Zachary K. Baker, Viktor K. Prasanna
FOCS
2004
IEEE
15 years 10 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
DIS
2006
Springer
15 years 10 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
« Prev « First page 1044 / 1320 Last » Next »