Sciweavers

2079 search results - page 316 / 416
» Universality of random graphs
Sort
View
INFOCOM
2003
IEEE
15 years 9 months ago
IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks
— 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...
Fan Bai, Narayanan Sadagopan, Ahmed Helmy
SAC
2003
ACM
15 years 9 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
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...
Günther R. Raidl, Bryant A. Julstrom
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 4 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
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...
Bodo Manthey, L. Shankar Ram
JCB
2002
160views more  JCB 2002»
15 years 4 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
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...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
CVPR
2009
IEEE
16 years 11 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...