Sciweavers

304 search results - page 41 / 61
» Mathematical Models of Computational and Combinatorial Struc...
Sort
View
AAAI
2006
15 years 5 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
132
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Visualizing and exploring planar algebraic arrangements: a web application
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
Pavel Emeliyanenko, Michael Kerber
FCT
2003
Springer
15 years 9 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
16 years 4 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
DOCENG
2010
ACM
15 years 1 months ago
Diffing, patching and merging XML documents: toward a generic calculus of editing deltas
This work addresses what we believe to be a central issue in the field of XML diff and merge computation: the mathematical modeling o-called editing deltas and the study of their ...
Jean-Yves Vion-Dury