Sciweavers

2498 search results - page 303 / 500
» Data Structures with Unpredictable Timing
Sort
View
FASE
2010
Springer
15 years 9 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller
CIKM
2008
Springer
15 years 8 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
USENIX
1994
15 years 7 months ago
Concert/C: A Language for Distributed Programming
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
Joshua S. Auerbach, Arthur P. Goldberg, Germ&aacut...
ICFP
2010
ACM
15 years 7 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
JMLR
2010
155views more  JMLR 2010»
15 years 5 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...