Sciweavers

3958 search results - page 152 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
16 years 7 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
ICMLA
2008
15 years 7 months ago
Multi-stage Learning of Linear Algebra Algorithms
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
Victor Eijkhout, Erika Fuentes
IEEECGIV
2005
IEEE
15 years 12 months ago
A Practical Implementation of a 3-D Game Engine
Creating a 3-D game engine is not a trivial task as gamers often demand for high quality output with top notch performance in games. In this paper, we show you how various real-ti...
Thomas C. S. Cheah, Kok-Why Ng
HPCC
2011
Springer
14 years 6 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
CONCUR
2008
Springer
15 years 8 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink