Sciweavers

1100 search results - page 103 / 220
» Approximate distance oracles
Sort
View
DAC
2007
ACM
15 years 11 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
70
Voted
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 3 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
92
Voted
EJC
2008
14 years 10 months ago
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
Jaroslav Nesetril, Patrice Ossona de Mendez
BIOINFORMATICS
2006
85views more  BIOINFORMATICS 2006»
14 years 10 months ago
Clusterv: a tool for assessing the reliability of clusters discovered in DNA microarray data
Summary: We present a new R package for the assessment of the reliability of clusters discovered in high dimensional DNA microarray data. The package implements methods based on r...
Giorgio Valentini
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 4 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...