Sciweavers

3604 search results - page 28 / 721
» All Common Subsequences
Sort
View
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
13 years 8 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
CSI
2007
96views more  CSI 2007»
13 years 8 months ago
A common criteria based security requirements engineering process for the development of secure information systems
In order to develop security critical Information Systems, specifying security quality requirements is vitally important, although it is a very difficult task. Fortunately, there ...
Daniel Mellado, Eduardo Fernández-Medina, M...
PIMRC
2010
IEEE
13 years 6 months ago
Transmission of common, public and confidential messages in broadcast channels with multiple antennas
Abstract-- We study the Gaussian multiple-input multipleoutput (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the...
Ersen Ekrem, Sennur Ulukus
ICIP
2007
IEEE
14 years 10 months ago
Common Spatial Pattern Discovery by Efficient Candidate Pruning
Automatically discovering common visual patterns in images is very challenging due to the uncertainties in the visual appearances of such spatial patterns and the enormous computa...
Junsong Yuan, Zhu Li, Yun Fu, Ying Wu, Thomas S. H...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm