Sciweavers

5056 search results - page 487 / 1012
» Network Coding Theory
Sort
View
159
Voted
ENTCS
2007
102views more  ENTCS 2007»
15 years 5 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
MLQ
2006
78views more  MLQ 2006»
15 years 5 months ago
Recursive logic frames
We define the concept of a logic frame, which extends the concept stract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the...
Saharon Shelah, Jouko A. Väänänen
AI
1998
Springer
15 years 4 months ago
GAS, A Concept on Modeling Species in Genetic Algorithms
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
Márk Jelasity, József Dombi
TIT
2002
102views more  TIT 2002»
15 years 4 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
15 years 2 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima