Sciweavers

1100 search results - page 68 / 220
» Approximate distance oracles
Sort
View
ENGL
2008
74views more  ENGL 2008»
14 years 10 months ago
Improving the Development of QSAR Prediction Models with the use of Approximate Similarity Approach
The improvement on the QSAR prediction of the trans-stilbenes affinity for the -amyloid peptide (employed for detecting the Alzheimer disease) achieved by means of using approximat...
Irene Luque Ruiz, Manuel Urbano-Cuadrado, Miguel &...
COCOON
2005
Springer
15 years 3 months ago
The Reverse Greedy Algorithm for the Metric K-Median Problem
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
Marek Chrobak, Claire Kenyon, Neal E. Young
ICDAR
2003
IEEE
15 years 3 months ago
Vectorization with the Voronoi L-diagram
A new precision vectorization method has been developed for building centerlines of plain shapes. First a dense skeleton is computed. Centerlines are obtained as a subset of branc...
Alexander Gribov, Eugene Bodansky
KAIS
2006
110views more  KAIS 2006»
14 years 10 months ago
Multi-step density-based clustering
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...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 3 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...