Sciweavers

4926 search results - page 31 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
IMR
1998
Springer
13 years 12 months ago
Mesh Graph Structure for Longest-Edge Refinement Algorithms
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
Angel Plaza, José P. Suárez, Miguel ...
CVPR
2007
IEEE
14 years 9 months ago
Multi-class object tracking algorithm that handles fragmentation and grouping
We propose a framework for detecting and tracking multiple interacting objects, while explicitly handling the dual problems of fragmentation (an object may be broken into several ...
Biswajit Bose, Xiaogang Wang, Eric Grimson
PVM
2010
Springer
13 years 6 months ago
Two Algorithms of Irregular Scatter/Gather Operations for Heterogeneous Platforms
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
Kiril Dichev, Vladimir Rychkov, Alexey L. Lastovet...
SENSYS
2005
ACM
14 years 1 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...