Sciweavers

739 search results - page 82 / 148
» Sorting Algorithms
Sort
View
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
ECTEL
2007
Springer
14 years 1 months ago
Relevance Ranking Metrics for Learning Objects
— The main objetive of this paper is to improve the current status of learning object search. First, the current situation is analyzed and a theretical solution, based on relevan...
Xavier Ochoa, Erik Duval
CCCG
2001
13 years 9 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 2 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
PDIS
1993
IEEE
13 years 11 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...