Sciweavers

813 search results - page 125 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
SG
2005
Springer
14 years 1 months ago
Automatic Cross-Sectioning Based on Topological Volume Skeletonization
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
Yuki Mori, Shigeo Takahashi, Takeo Igarashi, Yurik...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 1 days ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
DIM
2007
ACM
13 years 11 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
FOCS
2004
IEEE
13 years 11 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor