Sciweavers

655 search results - page 16 / 131
» On Flat Programs with Lists
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Bounds for binary codes relative to pseudo-distances of k points
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
Christine Bachoc, Gilles Zémor
FSTTCS
1993
Springer
13 years 11 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 9 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
LOPSTR
1998
Springer
13 years 12 months ago
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
Andreas Hamfelt, Jørgen Fischer Nilsson
KBSE
2008
IEEE
14 years 2 months ago
How Program History Can Improve Code Completion
Code completion is a widely used productivity tool. It takes away the burden of remembering and typing the exact names of methods or classes: As a developer starts typing a name, ...
Romain Robbes, Michele Lanza