Paul Helman

According to our database1, Paul Helman authored at least 23 papers between 1982 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Negative representations of information.
Int. J. Inf. Sec., 2009

2007
Protecting data privacy through hard-to-reverse negative databases.
Int. J. Inf. Sec., 2007

Learning and modeling biosignatures from tissue images.
Comput. Biol. Medicine, 2007

2005
On-line Negative Databases.
Int. J. Unconv. Comput., 2005

Learning Optimal Augmented Bayes Networks
CoRR, 2005

2004
A formal framework for positive and negative detection schemes.
IEEE Trans. Syst. Man Cybern. Part B, 2004

A Bayesian Network Classification Methodology for Gene Expression Data.
J. Comput. Biol., 2004

Online Negative Databases.
Proceedings of the Artificial Immune Systems, Third International Conference, 2004

2003
The Crossover Closure and Partial Match Detection.
Proceedings of the Artificial Immune Systems, Second International Conference, 2003

2001
The application of automated reasoning to formal models of combinatorial optimization.
Appl. Math. Comput., 2001

1998
Prioritizing Information for the Discovery of Phenomena.
J. Intell. Inf. Syst., 1998

1997
A statistically based system for prioritizing information exploration under uncertainty.
IEEE Trans. Syst. Man Cybern. Part A, 1997

1996
An Immunological Approach to Change Detection: Algorithms, Analysis and Implications.
Proceedings of the 1996 IEEE Symposium on Security and Privacy, 1996

1993
Statistical Foundations of Audit Trail Analysis for the Detection of Computer Misuse.
IEEE Trans. Software Eng., 1993

An Exact Characterization of Greedy Structures.
SIAM J. Discret. Math., 1993

1992
Foundations of Intrusion Detection.
Proceedings of the 5th IEEE Computer Security Foundations Workshop, 1992

1991
A Mass Production Technique to Speed Multiple-Query Optimization and Physical Database Design.
INFORMS J. Comput., 1991

Intermediate problem solving and data structures - walls and mirrors (2. ed.).
Benjamin/Cummings series in computer science, Benjamin/Cummings, ISBN: 978-0-8053-0321-6, 1991

1989
A common schema for dynamic programming and branch and bound algorithms.
J. ACM, 1989

A Family of NP-Complete Data Aggregation Problems.
Acta Informatica, 1989

1988
Designing Deductive Databases.
J. Autom. Reason., 1988

1986
Understanding and Extending Transformation-Based Optimizers.
IEEE Database Eng. Bull., 1986

1982
A New Theory of Dynamic Programming.
PhD thesis, 1982


  Loading...