Sciweavers

288 search results - page 50 / 58
» An algebraic generalization of Kripke structures
Sort
View
DOLAP
2005
ACM
13 years 9 months ago
A relevance-extended multi-dimensional model for a data warehouse contextualized with documents
Current data warehouse and OLAP technologies can be applied to analyze the structured data that companies store in their databases. The circumstances that describe the context ass...
Juan Manuel Pérez, Rafael Berlanga Llavori,...
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
JCO
2008
102views more  JCO 2008»
13 years 7 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
IANDC
2007
133views more  IANDC 2007»
13 years 7 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich