1012 search results - page 174 / 203 » Segment intersection searching problems in general settings |
SPAA
2003
ACM
14 years 19 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
CIVR
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
PKDD
1998
Springer
13 years 11 months ago
1998
Springer
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better de...