Sciweavers

2593 search results - page 399 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
DAC
2010
ACM
13 years 9 months ago
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
Zhuo Feng, Zhiyu Zeng
WG
1993
Springer
14 years 1 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
CSR
2006
Springer
14 years 21 days ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin
DASFAA
2011
IEEE
177views Database» more  DASFAA 2011»
13 years 16 days ago
Optimizing Incremental Maintenance of Minimal Bisimulation of Cyclic Graphs
Abstract. Graph-structured databases have numerous recent applications including the Semantic Web, biological databases and XML, among many others. In this paper, we study the main...
Jintian Deng, Byron Choi, Jianliang Xu, Sourav S. ...
CGF
2010
218views more  CGF 2010»
13 years 9 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...