Sciweavers

2342 search results - page 124 / 469
» Sublinear geometric algorithms
Sort
View
COLOGNETWENTE
2010
15 years 1 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
MOBIHOC
2004
ACM
16 years 2 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 7 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
FUIN
2006
98views more  FUIN 2006»
15 years 3 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
15 years 9 months ago
Supervised Learning of Topological Maps using Semantic Information Extracted from Range Data
Abstract— This paper presents an approach to create topological maps from geometric maps obtained with a mobile robot in an indoor-environment using range data. Our approach util...
Óscar Martínez Mozos, Wolfram Burgar...