Sciweavers

463 search results - page 89 / 93
» The lattice dimension of a graph
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 8 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
JAT
2010
109views more  JAT 2010»
13 years 7 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
ICDE
2007
IEEE
193views Database» more  ICDE 2007»
14 years 10 months ago
Categorization and Optimization of Synchronization Dependencies in Business Processes
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
Qinyi Wu, Calton Pu, Akhil Sahai, Roger S. Barga
EDBT
2010
ACM
185views Database» more  EDBT 2010»
14 years 3 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman