Sciweavers

1347 search results - page 61 / 270
» On the Structure of the Minimum Time Function
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 8 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 9 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
ESOP
2000
Springer
14 years 19 days ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
SIGPLAN
2002
13 years 8 months ago
Template meta-programming for Haskell
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithm...
Tim Sheard, Simon L. Peyton Jones
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
14 years 22 days ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun