Sciweavers

1431 search results - page 210 / 287
» The complexity of random ordered structures
Sort
View
DMDW
2003
134views Management» more  DMDW 2003»
15 years 5 months ago
Using Design Guidelines to Improve Data Warehouse Logical Design
Data Warehouse-(DW) logical design often start with a conceptual schema and then generates relational structures. Applying this approach implies to cope with two main aspects: (i) ...
Verónika Peralta, Raul Ruggia
126
Voted
ECAI
2010
Springer
15 years 3 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
ISVD
2010
IEEE
15 years 2 months ago
Alpha Shape Topology of the Cosmic Web
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
Rien van de Weygaert, Erwin Platen, Gert Vegter, B...
99
Voted
JCC
2010
87views more  JCC 2010»
15 years 2 months ago
Crystal contacts as nature's docking solutions
The assumption that crystal contacts reflect natural macromolecular interactions makes a basis for many studies in structural biology. However, the crystal state may correspond t...
Evgeny B. Krissinel
192
Voted
CPAIOR
2010
Springer
15 years 1 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey