17366 search results - page 385 / 3474 » New Revision Algorithms |
211
click to vote
LATIN
1995
Springer
15 years 10 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
164
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
171
click to vote
IJCSS
2000
15 years 6 months ago
2000
This paper describes a new approach, HIDER (HIerarchical DEcision Rules), for learning rules in continuous and discrete domains based on evolutive algorithms. The algorithm produce...
197
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
162
click to vote
ECIR
2009
Springer
16 years 4 months ago
2009
Springer
This paper presents a new approach designed to reduce the computational load of the existing clustering algorithms by trimming down the documents size using fingerprinting methods...