Sciweavers

1922 search results - page 215 / 385
» ie 2007
Sort
View
CEC
2007
IEEE
16 years 1 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
CIDM
2007
IEEE
16 years 1 months ago
Measuring the Validity of Document Relations Discovered from Frequent Itemset Mining
— The extension approach of frequent itemset mining can be applied to discover the relations among documents. Several schemes, i.e., n-gram, stemming, stopword removal and term w...
Kritsada Sriphaew, Thanaruk Theeramunkong
COMPSAC
2007
IEEE
16 years 1 months ago
Architecture-Based Software Reliability: Why Only a Few Parameters Matter?
Uncertainty analysis through sensitivity studies and quantification of the variance of the reliability estimate has become more common in architecture-based software reliability ...
Katerina Goseva-Popstojanova, Margaret Hamill
COMSWARE
2007
IEEE
16 years 1 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
CSFW
2007
IEEE
16 years 1 months ago
LTL Model Checking for Security Protocols
Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their applicability...
Alessandro Armando, Roberto Carbone, Luca Compagna