Sciweavers

453 search results - page 37 / 91
» On Approximation of Bookmark Assignments
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
13 years 9 months ago
Gene annotation and network inference by phylogenetic profiling
Background: Phylogenetic analysis is emerging as one of the most informative computational methods for the annotation of genes and identification of evolutionary modules of functi...
Jie Wu, Zhenjun Hu, Charles DeLisi
INFOCOM
2009
IEEE
14 years 4 months ago
Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
Mhameed Aezladen, Reuven Cohen, Danny Raz
SOFSEM
2007
Springer
14 years 3 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
ICPR
2006
IEEE
14 years 3 months ago
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...
Andreas Klaus, Mario Sormann, Konrad F. Karner
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 3 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia