Sciweavers

860 search results - page 73 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
13 years 12 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
ICAPR
2005
Springer
14 years 1 months ago
Texture Exemplars for Defect Detection on Random Textures
We present a new approach to detecting defects in random textures which requires only very few defect free samples for unsupervised training. Each product image is divided into ove...
Xianghua Xie, Majid Mirmehdi
KAIS
2000
87views more  KAIS 2000»
13 years 7 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Finding Popular Places
Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, ...
Marc Benkert, Bojan Djordjevic, Joachim Gudmundsso...
IDA
2007
Springer
13 years 7 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando