Sciweavers

14054 search results - page 2663 / 2811
» P
Sort
View
131
Voted
COCOA
2008
Springer
15 years 7 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
COMPGEOM
2008
ACM
15 years 7 months ago
Untangling triangulations through local explorations
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
Pankaj K. Agarwal, Bardia Sadri, Hai Yu
CONEXT
2008
ACM
15 years 7 months ago
Opportunistic use of client repeaters to improve performance of WLANs
Currently deployed IEEE 802.11 WLANs (Wi-Fi networks) share access point (AP) bandwidth on a per-packet basis. However, the various stations communicating with the AP often have d...
Paramvir Bahl, Ranveer Chandra, Patrick P. C. Lee,...
RECOMB
2010
Springer
15 years 7 months ago
Algorithms for Detecting Significantly Mutated Pathways in Cancer
Abstract. Recent genome sequencing studies have shown that the somatic mutations that drive cancer development are distributed across a large number of genes. This mutational heter...
Fabio Vandin, Eli Upfal, Benjamin J. Raphael
CPAIOR
2008
Springer
15 years 7 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
« Prev « First page 2663 / 2811 Last » Next »