Sciweavers

2487 search results - page 344 / 498
» Partitions of Graphs into Trees
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 3 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
14 years 7 days ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
SIGMOD
2005
ACM
194views Database» more  SIGMOD 2005»
14 years 1 months ago
STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
SENSYS
2003
ACM
14 years 1 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
FOCS
1995
IEEE
13 years 12 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos