Sciweavers

236 search results - page 13 / 48
» A New Neighborhood Based on Improvement Graph for Robust Gra...
Sort
View
IH
1999
Springer
14 years 21 days ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
14 years 2 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
IJCNN
2006
IEEE
14 years 2 months ago
Predictive Random Graph Ranking on the Web
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
Haixuan Yang, Irwin King, Michael R. Lyu
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 7 months ago
Multiple relative pose graphs for robust cooperative mapping
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
Been Kim, Michael Kaess, Luke Fletcher, John J. Le...
AE
2007
Springer
14 years 2 months ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz