Sciweavers

5595 search results - page 436 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
16 years 7 months ago
Learning methods for lung tumor markerless gating in image-guided radiotherapy
In an idealized gated radiotherapy treatment, radiation is delivered only when the tumor is at the right position. For gated lung cancer radiotherapy, it is difficult to generate ...
Ying Cui, Jennifer G. Dy, Gregory C. Sharp, Brian ...
222
Voted
AAAI
2010
15 years 8 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He
229
Voted
COMPGEOM
2011
ACM
14 years 10 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
CLUSTER
2007
IEEE
16 years 1 months ago
Anomaly localization in large-scale clusters
— A critical problem facing by managing large-scale clusters is to identify the location of problems in a system in case of unusual events. As the scale of high performance compu...
Ziming Zheng, Yawei Li, Zhiling Lan
204
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 6 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...