Sciweavers

2621 search results - page 42 / 525
» Near orders and codes
Sort
View
ECOOP
1998
Springer
14 years 2 months ago
An Imperative, First-Order Calculus with Object Extension
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
Viviana Bono, Kathleen Fisher
POPL
1995
ACM
14 years 1 months ago
Applicative Functors and Fully Transparent Higher-Order Modules
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
Xavier Leroy
KDD
2006
ACM
381views Data Mining» more  KDD 2006»
14 years 10 months ago
GPLAG: detection of software plagiarism by program dependence graph analysis
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
Chao Liu 0001, Chen Chen, Jiawei Han, Philip S. Yu
VTC
2010
IEEE
136views Communications» more  VTC 2010»
13 years 8 months ago
HARQ Aided Systematic LT Coding for Amplify-Forward and Decode-Forward Cooperation
—Systematic Luby Transform (SLT) codes constitute rateless codes, which are capable of adaptively adjusting their code rate depending on the channel quality without explicit chan...
Hoang Anh Ngo, Thanh Dang Nguyen, Lajos Hanzo
GECCO
2000
Springer
14 years 1 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui