Sciweavers

273 search results - page 34 / 55
» CI-Graph: An efficient approach for large scale SLAM
Sort
View
SMA
2006
ACM
225views Solid Modeling» more  SMA 2006»
15 years 3 months ago
Feature sensitive mesh segmentation
Segmenting meshes into natural regions is useful for model understanding and many practical applications. In this paper, we present a novel, automatic algorithm for segmenting me...
Yu-Kun Lai, Qian-Yi Zhou, Shi-Min Hu, Ralph R. Mar...
EUROPAR
2008
Springer
14 years 11 months ago
Mapping Heterogeneous Distributed Applications on Clusters
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Sylvain Jubertie, Emmanuel Melin, Jér&eacut...
NIPS
2008
14 years 11 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
CISIS
2010
IEEE
14 years 7 months ago
Scalable Grid Resource Trading with Greedy Heuristics
As Grid infrastructures become more widely used by the academic and commercial world, the problem of resource allocation increases in complexity. Resource trading markets are one m...
Georg Buss, Kevin Lee, Daniel Veit
ICIP
2005
IEEE
15 years 11 months ago
Predictive compression of dynamic 3D meshes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies tha...
Aljoscha Smolic, Karsten Müller, Matthias Kau...