Sciweavers

906 search results - page 158 / 182
» Map graphs
Sort
View
GLOBECOM
2008
IEEE
13 years 8 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
ECCV
2010
Springer
13 years 7 months ago
Segmenting Salient Objects from Images and Videos
Abstract. In this paper we introduce a new salient object segmentation method, which is based on combining a saliency measure with a conditional random field (CRF) model. The propo...
Esa Rahtu, Juho Kannala, Mikko Salo, Janne Heikkil...
EUROPAR
2010
Springer
13 years 7 months ago
Multi-GPU and Multi-CPU Parallelization for Interactive Physics Simulations
Today, it is possible to associate multiple CPUs and multiple GPUs in a single shared memory architecture. Using these resources efficiently in a seamless way is a challenging issu...
Everton Hermann, Bruno Raffin, François Fau...
CVIU
2008
180views more  CVIU 2008»
13 years 7 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 7 months ago
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
Gregory Gutin, Arash Rafiey, Anders Yeo