Sciweavers

2822 search results - page 18 / 565
» Mining Optimized Ranges
Sort
View
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
Arnaud Soulet, Bruno Crémilleux
ICIP
2008
IEEE
14 years 10 months ago
Spectral range selection for face recognition under various illuminations
Multipectral imaging and fusion of multispectral images in visible spectrum have been employed and proved to enhance the recognition performance over conventional broad-band image...
Hong Chang, Yi Yao, Andreas Koschan, Besma R. Abid...
ICRA
2006
IEEE
119views Robotics» more  ICRA 2006»
14 years 2 months ago
Polygonal Approximation of Laser Range Data based on Perceptual Grouping and EM
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
Longin Jan Latecki, Rolf Lakämper
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 10 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
DPD
2006
141views more  DPD 2006»
13 years 8 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...