352 search results - page 51 / 71 » A local search approximation algorithm for k-means clusterin... |
ICTAI
2010
IEEE
14 years 7 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
NIPS
2007
14 years 11 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
IPM
2007
14 years 9 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
PR
2008
14 years 9 months ago
2008
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
AAAI
2008
14 years 12 months ago
2008
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...