2310 search results - page 387 / 462 » Coloring Random Graphs |
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are curren...
SAC
2003
ACM
14 years 1 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
JCB
2002
13 years 7 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...