Sciweavers

611 search results - page 42 / 123
» Index Sets of Computable Structures with Decidable Theories
Sort
View
COMPSEC
2004
91views more  COMPSEC 2004»
13 years 7 months ago
Predicting the intrusion intentions by observing system call sequences
Identifying the intentions or attempts of the monitored agents through observations is very vital in computer network security. In this paper, a plan recognition method for predict...
Li Feng, Xiaohong Guan, Sangang Guo, Yan Gao, Pein...
CVBIA
2005
Springer
14 years 1 months ago
Segmenting Cardiopulmonary Images Using Manifold Learning with Level Sets
Cardiopulmonary imaging is a key tool in modern diagnostic and interventional medicine. Automated analysis of MRI or ultrasound video is complicated by limitations on the image qua...
Qilong Zhang, Robert Pless
KR
1992
Springer
14 years 1 days ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder
SIGSOFT
2006
ACM
14 years 1 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 8 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic