Sciweavers

2463 search results - page 439 / 493
» Rankings of Directed Graphs
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 9 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
DCG
2010
171views more  DCG 2010»
13 years 9 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 9 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
CAGD
2006
72views more  CAGD 2006»
13 years 9 months ago
Discrete one-forms on meshes and applications to 3D mesh parameterization
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
Steven J. Gortler, Craig Gotsman, Dylan Thurston
CAL
2006
13 years 9 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani