Sciweavers

4536 search results - page 128 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
104
Voted
ECCV
2010
Springer
15 years 7 months ago
Finding Semantic Structures in Image Hierarchies using Laplacian Graph Energy
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
98
Voted
RT
2005
Springer
15 years 7 months ago
Radiance Cache Splatting: A GPU-Friendly Global Illumination Algorithm
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
Pascal Gautron, Jaroslav Krivánek, Kadi Bou...
130
Voted
OOPSLA
1999
Springer
15 years 6 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
102
Voted
ISPDC
2006
IEEE
15 years 8 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
124
Voted
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 2 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...