2752 search results - page 180 / 551 » Rounding to an Integral Program |
188
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
149
click to vote
ECCC
2006
15 years 6 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
216
Voted
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
143
click to vote
ITICSE
2005
ACM
15 years 11 months ago
2005
ACM
One of the largest barriers to learning programming is the precise and complex syntax required to write programs. This barrier is a key impediment to the integration of programmin...
246
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...