Sciweavers

2487 search results - page 48 / 498
» Partitions of Graphs into Trees
Sort
View
ICDM
2006
IEEE
169views Data Mining» more  ICDM 2006»
14 years 3 months ago
Privacy-Preserving Data Imputation
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...
Geetha Jagannathan, Rebecca N. Wright
WAOA
2007
Springer
170views Algorithms» more  WAOA 2007»
14 years 3 months ago
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
José R. Correa, Cristina G. Fernandes, Mart...
CCCG
2007
13 years 10 months ago
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
ICPR
2008
IEEE
14 years 3 months ago
A new clustering approach based on graph partitioning for navigation patterns mining
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
Mehrdad Jalali, Norwati Mustapha, Ali Mamat, Nasir...
VLSID
2002
IEEE
149views VLSI» more  VLSID 2002»
14 years 9 months ago
Functional Partitioning for Low Power Distributed Systems of Systems-on-a-Chip
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
Yunsi Fei, Niraj K. Jha