Sciweavers

4536 search results - page 727 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 11 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
CG
2008
Springer
13 years 11 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 11 months ago
Boosting Multi-Core Reachability Performance with Shared Hash Tables
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
IVC
2006
137views more  IVC 2006»
13 years 10 months ago
An information-theoretic approach to face recognition from face motion manifolds
In this work we consider face recognition from Face Motion Manifolds (FMMs). The use of the Resistor-Average Distance (RAD) as a dissimilarity measure between densities confined t...
Ognjen Arandjelovic, Roberto Cipolla
PR
2008
169views more  PR 2008»
13 years 10 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...