Sciweavers

668 search results - page 68 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
113
Voted
CSR
2008
Springer
15 years 4 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
117
Voted
IPPS
2007
IEEE
15 years 8 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
115
Voted
COCOON
2009
Springer
15 years 9 months ago
Computing Bond Types in Molecule Graphs
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
Sebastian Böcker, Quang Bao Anh Bui, Patrick ...
143
Voted
CAD
2007
Springer
15 years 2 months ago
Detection of closed sharp edges in point clouds using normal estimation and graph theory
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
Kris Demarsin, Denis Vanderstraeten, Tim Volodine,...
157
Voted
SASO
2007
IEEE
15 years 8 months ago
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, A...