522 search results - page 40 / 105 » Energy Models for Graph Clustering |
137
click to vote
NAACL
2007
15 years 6 months ago
2007
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
158
Voted
EDBT
2012
ACM
13 years 7 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
141
click to vote
IEEEPACT
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
154
click to vote
DCOSS
2006
Springer
15 years 8 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
148
click to vote
IPMI
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...