Sciweavers

840 search results - page 57 / 168
» The Complexity of the Extended GCD Problem
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Network Protocol System Fingerprinting - A Formal Approach
— Network protocol system fingerprinting has been recognized as an important issue and a major threat to network security. Prevalent works rely largely on human experiences and i...
Guoqiang Shu, David Lee
FOSSACS
2006
Springer
15 years 1 months ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
ANOR
2010
82views more  ANOR 2010»
14 years 10 months ago
Time-based detection of changes to multivariate patterns
Detection of changes to multivariate patterns is an important topic in a number of different domains. Modern data sets often include categorical and numerical data and potentially...
Jing Hu, George C. Runger
ACTA
2002
111views more  ACTA 2002»
14 years 9 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht