3320 search results - page 359 / 664 » Heuristics for the Phylogeny Problem |
156
click to vote
ACSAC
2003
IEEE
16 years 3 days ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
148
click to vote
HICSS
2003
IEEE
16 years 2 days ago
2003
IEEE
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
168
Voted
ISCAS
2003
IEEE
16 years 2 days ago
2003
IEEE
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
164
click to vote
ISQED
2003
IEEE
16 years 2 days ago
2003
IEEE
An algorithm for mapping core terminals to System-On-a-Chip (SOC) I/O pins and scheduling tests in order to achieve costefficient concurrent test for core-based designs is present...
178
click to vote
ICSE
2003
IEEE-ACM
16 years 8 hour ago
2003
IEEE-ACM
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...