1887 search results - page 4 / 378 » Clustering with Local Restrictions |
69
Voted
UAI
2008
14 years 11 months ago
2008
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
95
Voted
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
105
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
We present an approach to parallel variational optical flow computation on standard hardware by domain decomposition. Using an arbitrary partition of the image plane into rectangul...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...