Sciweavers

2463 search results - page 438 / 493
» Rankings of Directed Graphs
Sort
View
DAIS
2009
13 years 10 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
13 years 10 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana
CGF
2010
155views more  CGF 2010»
13 years 9 months ago
SmallWorlds: Visualizing Social Recommendations
We present SmallWorlds, a visual interactive graph-based interface that allows users to specify, refine and build item-preference profiles in a variety of domains. The interface f...
Brynjar Gretarsson, John O'Donovan, Svetlin Bostan...
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 9 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
COMGEO
2008
ACM
13 years 9 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...