3020 search results - page 52 / 604 » Optimal partition trees |
157
Voted
TCS
2008
15 years 3 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
141
Voted
INFOVIS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
119
Voted
DSN
2004
IEEE
15 years 7 months ago
2004
IEEE
Abstract-We present a new form of quantitative safety analysis safety optimization. This method is a combination of fault tree analysis(FTA) and mathematical optimization technique...
127
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
137
Voted
JMLR
2010
14 years 10 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...