Sciweavers

2477 search results - page 194 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
HCW
1999
IEEE
15 years 10 months ago
Metacomputing with MILAN
The MILAN project, a joint effort involving Arizona State University and New York University, has produced and validated fundamental techniques for the realization of efficient, r...
Arash Baratloo, Partha Dasgupta, Vijay Karamcheti,...
SIGSOFT
2005
ACM
15 years 12 months ago
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Programs usually follow many implicit programming rules, most of which are too tedious to be documented by programmers. When these rules are violated by programmers who are unawar...
Zhenmin Li, Yuanyuan Zhou
PLDI
2012
ACM
13 years 8 months ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...
ICLP
1997
Springer
15 years 10 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
CORR
2012
Springer
218views Education» more  CORR 2012»
14 years 2 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin