2254 search results - page 292 / 451 » Computing the minimal covering set |
183
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
215
Voted
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide-area network. Efficient execution of such data t...
178
click to vote
ESOP
2007
Springer
16 years 1 months ago
2007
Springer
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
171
click to vote
SCALESPACE
2007
Springer
16 years 1 months ago
2007
Springer
In this work, we address the problem of segmenting multiple objects, under possible occlusions, in a level set framework. A variational energy that incorporates a piecewise constan...
167
Voted
PAM
2005
Springer
16 years 16 days ago
2005
Springer
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...