101 search results - page 2 / 21 » An Algorithm to Find a Perfect Map for Graphoid Structures |
ICRA
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
ICMCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
ACL
1993
13 years 6 months ago
1993
The paper describes an algorithm that employs English and French text taggers to associate noun phrases in an aligned bilingual corpus. The taggets provide part-of-speech categori...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...