Sciweavers

104 search results - page 12 / 21
» Efficient Algorithms for k Maximum Sums
Sort
View
ICC
2009
IEEE
207views Communications» more  ICC 2009»
14 years 2 months ago
Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks
—Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of ...
Zijian Wang, Eyuphan Bulut, Boleslaw K. Szymanski
COCOON
2008
Springer
13 years 9 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
COMGEO
2006
ACM
13 years 7 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
BMCBI
2005
134views more  BMCBI 2005»
13 years 7 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 9 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh