Sciweavers

982 search results - page 116 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
ICIP
2000
IEEE
16 years 2 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
113
Voted
BIOINFORMATICS
2008
119views more  BIOINFORMATICS 2008»
15 years 22 days ago
Optimal design of thermally stable proteins
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...
Ryan M. Bannen, Vanitha Suresh, George N. Phillips...
107
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
Guofeng Deng, Sandeep K. S. Gupta
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 2 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
142
Voted
JCIT
2008
129views more  JCIT 2008»
15 years 18 days ago
An Enhanced tree based MAODV Protocol for MANETs using Genetic Algorithm
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
E. Baburaj, V. Vasudevan