3928 search results - page 457 / 786 » order 2006 |
220
click to vote
KAIS
2006
15 years 7 months ago
2006
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
215
click to vote
JACM
2000
15 years 7 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
192
click to vote
IPL
2002
15 years 7 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
245
click to vote
ISCI
2002
15 years 7 months ago
2002
In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBM...
202
click to vote
MP
2002
15 years 7 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...