450 search results - page 84 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
110
click to vote
TALG
2010
14 years 6 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
188
click to vote
GIS
2007
ACM
16 years 26 days ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
RECOMB
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
100
click to vote
CVPR
2007
IEEE
15 years 6 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
134
click to vote
SPAA
1997
ACM
15 years 4 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...