1174 search results - page 121 / 235 » Optimizing generics is easy! |
154
click to vote
IPTPS
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
148
click to vote
EUROGP
2010
Springer
15 years 9 months ago
2010
Springer
We describe a data mining framework that derives panelist information from sparse flavour survey data. One component of the framework executes genetic programming ensemble based s...
125
click to vote
ICRA
2000
IEEE
15 years 9 months ago
2000
IEEE
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
112
click to vote
ICRA
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper introduces a novel heuristic nmdmap method for path planning, one that is inspired by the Vomnoi diagmm concept, but easiZy applicable to geneml configurntion spaces. T...
139
click to vote
VLDB
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...