Sciweavers

1193 search results - page 167 / 239
» Database Query Languages and Functional Logic Programming
Sort
View
BIRTHDAY
1992
Springer
15 years 1 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
15 years 10 months ago
Building search applications with Marklogic Server
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...
Ron Avnur
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 3 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
POPL
2010
ACM
15 years 7 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
ICFP
2012
ACM
13 years 6 days ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...