Sciweavers

16616 search results - page 3323 / 3324
» Extending Extended Vacuity
Sort
View
BMCBI
2006
122views more  BMCBI 2006»
14 years 10 months ago
PET-Tool: a software suite for comprehensive processing and managing of Paired-End diTag (PET) sequence data
Background: We recently developed the Paired End diTag (PET) strategy for efficient characterization of mammalian transcriptomes and genomes. The paired end nature of short PET se...
Kuo Ping Chiu, Chee-Hong Wong, Qiongyu Chen, Prami...
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
14 years 9 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
CG
2005
Springer
14 years 9 months ago
Interpretive OpenGL for computer graphics
OpenGL is the industry-leading, cross-platform graphics application programming interface (API), and the only major API with support for virtually all operating systems. Many lang...
Bo Chen, Harry H. Cheng
ECCC
2007
147views more  ECCC 2007»
14 years 9 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
« Prev « First page 3323 / 3324 Last » Next »