Sciweavers

1687 search results - page 326 / 338
» Which pointer analysis should I use
Sort
View
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 9 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
ASUNAM
2010
IEEE
13 years 8 months ago
Product Adoption Networks and Their Growth in a Large Mobile Phone Network
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...
Pal Roe Sundsoy, Johannes Bjelland, Geoffrey Canri...
CN
2008
140views more  CN 2008»
13 years 7 months ago
Congestion control in utility fair networks
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
Tobias Harks, Tobias Poschwatta
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
BMCBI
2005
104views more  BMCBI 2005»
13 years 7 months ago
Wildfire: distributed, Grid-enabled workflow construction and execution
Background: We observe two trends in bioinformatics: (i) analyses are increasing in complexity, often requiring several applications to be run as a workflow; and (ii) multiple CPU...
Francis Tang, Ching Lian Chua, Liang-Yoong Ho, Yun...