Sciweavers

78 search results - page 12 / 16
» Graph Matching Based on Node Signatures
Sort
View
ICRA
2006
IEEE
198views Robotics» more  ICRA 2006»
14 years 1 months ago
3D Navigation based on a Visual Memory
— This paper addresses the design of a control law for vision-based robot navigation. The method proposed is based on a topological representation of the environment. Within this...
Anthony Remazeilles, François Chaumette, Pa...
ALGOSENSORS
2009
Springer
13 years 5 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
14 years 2 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
ICDAR
2005
IEEE
14 years 1 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 5 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor