Sciweavers

336 search results - page 13 / 68
» Improved data structures for fully dynamic biconnectivity
Sort
View
ICALP
2010
Springer
15 years 4 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
AOSD
2007
ACM
15 years 3 months ago
Performance improvement for persistent systems by AOP
Efficient data retrieval from databases is a significant issue of the design of persistent systems. We propose an aspect oriented persistent system named AspectualStore. Aspectual...
Yasuhiro Aoki, Shigeru Chiba
SBBD
2004
89views Database» more  SBBD 2004»
15 years 1 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
14 years 10 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...
95
Voted
VIP
2001
15 years 1 months ago
Three-dimensional Medical Image Segmentation Using a Graph-Theoretic Energy-Minimisation Approach
A new graph algorithm for multiscale segmentation of threedimensional medical data sets is presented. It is a threedimensional generalisation of an existing two-dimensional Mumfor...
Brian Parker