Sciweavers

2938 search results - page 559 / 588
» On obfuscating point functions
Sort
View
ECAI
2010
Springer
13 years 10 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
13 years 10 months ago
Balancing Degree, Diameter and Weight in Euclidean Spanners
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
Shay Solomon, Michael Elkin
ICFP
2010
ACM
13 years 10 months ago
TeachScheme!: a checkpoint
In 1995, my team and I decided to create an outreach project that would use our research on functional programming to change the K-12 computer science curriculum. We had two diffe...
Matthias Felleisen
HASKELL
2008
ACM
13 years 10 months ago
Haskell: batteries included
The quality of a programming language itself is only one component in the ability of application writers to get the job done. Programming languages can succeed or fail based on th...
Duncan Coutts, Isaac Potoczny-Jones, Don Stewart
ACMDIS
2010
ACM
13 years 9 months ago
The CLOTHO project: predicting application utility
When using the computer, each user has some notion that "these applications are important" at a given point in time. We term this subset of applications that the user va...
Joshua M. Hailpern, Nicholas Jitkoff, Joseph Subid...