Sciweavers

2636 search results - page 258 / 528
» Linear Programming
Sort
View
PLDI
2010
ACM
16 years 14 days ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 8 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
PPDP
2010
Springer
15 years 1 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
PARA
1995
Springer
15 years 6 months ago
ScaLAPACK Tutorial
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
Jack Dongarra, Antoine Petitet
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 4 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...