1008 search results - page 177 / 202 » Minimizing Average Flow-Time |
180
click to vote
JMIV
2006
15 years 3 months ago
2006
In this paper, we propose to focus on the segmentation of vectorial features (e.g. vector fields or color intensity) using region-based active contours. We search for a domain that...
150
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
156
click to vote
TCAD
2008
15 years 3 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
145
click to vote
ALGORITHMICA
2000
15 years 3 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
150
click to vote
TON
2010
14 years 10 months ago
2010
Abstract-- Security issues and attack management in transparent WDM (Wavelength Division Multiplexing) optical networks has become of prime importance to network operators due to t...