Sciweavers

2487 search results - page 20 / 498
» Partitions of Graphs into Trees
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 10 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
AI
2010
Springer
13 years 9 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
SSD
2007
Springer
107views Database» more  SSD 2007»
14 years 3 months ago
Spatial Partition Graphs: A Graph Theoretic Model of Maps
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
Mark McKenney, Markus Schneider
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 3 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
MLDM
2005
Springer
14 years 2 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé