Sciweavers

2430 search results - page 336 / 486
» Computing Tutte Polynomials
Sort
View
153
Voted
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 9 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
145
Voted
ECCV
2004
Springer
15 years 9 months ago
Null Space Approach of Fisher Discriminant Analysis for Face Recognition
The null space of the within-class scatter matrix is found to express most discriminative information for the small sample size problem (SSSP). The null space-based LDA takes full ...
Wei Liu, Yunhong Wang, Stan Z. Li, Tieniu Tan
118
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
106
Voted
STACS
2004
Springer
15 years 9 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
129
Voted
ACSAC
2003
IEEE
15 years 9 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...