Sciweavers

208 search results - page 11 / 42
» A Normal Form for Function Rings of Piecewise Functions
Sort
View
ALT
2001
Springer
14 years 4 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara
ICFP
2007
ACM
14 years 7 months ago
User-friendly functional programming for web mashups
MashMaker is a web-based tool that makes it easy for a normal user to create web mashups by browsing around, without needing to type, or plan in advance what they want to do. Like...
Robert Ennals, David Gay
CPAIOR
2007
Springer
14 years 1 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
APLAS
2004
ACM
14 years 29 days ago
PType System: A Featherweight Parallelizability Detector
Parallel programming is becoming an important cornerstone of general computing. In addition, type systems have significant impact on program analysis. In this paper, we demonstrat...
Dana N. Xu, Siau-Cheng Khoo, Zhenjiang Hu
JCT
2007
111views more  JCT 2007»
13 years 7 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky