Sciweavers

5096 search results - page 327 / 1020
» Associations as a Language Construct
Sort
View
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 6 months ago
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
Patrick Dehornoy
EOR
2006
83views more  EOR 2006»
15 years 6 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
IDA
2009
Springer
15 years 4 months ago
Efficient Vertical Mining of Frequent Closures and Generators
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
ML
2006
ACM
103views Machine Learning» more  ML 2006»
16 years 22 days ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...

Book
288views
17 years 5 months ago
Loving Lisp - the Savy Programmer's Secret Weapon
"This book is intended to get you, the reader, programming quickly in Common Lisp. Although the Lisp programming language is often associated with artificial intelligence, t...
Mark Watson