424 search results - page 31 / 85 » Clustering with Local and Global Regularization |
ITSL
2008
13 years 9 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
PLDI
2003
ACM
14 years 29 days ago
2003
ACM
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
VEE
2009
ACM
14 years 2 months ago
2009
ACM
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
AAAI
2008
13 years 10 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...