4009 search results - page 317 / 802 » Clustering on Complex Graphs |
163
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed abstractions to ...
195
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a Diffusion Maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well-known that diffusion tensor imaging (DTI)...
186
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
156
click to vote
FSTTCS
2007
Springer
16 years 27 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
185
click to vote
AI
2003
Springer
15 years 12 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...