Sciweavers

1653 search results - page 13 / 331
» Directed tree-width examples
Sort
View
SIROCCO
2000
13 years 11 months ago
Lower bounds for (weak) sense of direction
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
Paolo Boldi, Sebastiano Vigna
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
13 years 9 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
M. C. Campi, A. Lecchini, Sergio M. Savaresi
RTA
1991
Springer
14 years 1 months ago
Narrowing Directed by a Graph of Terms
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
Jacques Chabin, Pierre Réty
SDM
2004
SIAM
218views Data Mining» more  SDM 2004»
13 years 11 months ago
Mixture Density Mercer Kernels: A Method to Learn Kernels Directly from Data
This paper presents a method of generating Mercer Kernels from an ensemble of probabilistic mixture models, where each mixture model is generated from a Bayesian mixture density e...
Ashok N. Srivastava
USS
2008
14 years 1 days ago
Automatic Generation of XSS and SQL Injection Attacks with Goal-Directed Model Checking
Cross-site scripting (XSS) and SQL injection errors are two prominent examples of taint-based vulnerabilities that have been responsible for a large number of security breaches in...
Michael C. Martin, Monica S. Lam