296 search results - page 31 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
153
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
155
click to vote
GBRPR
2007
Springer
16 years 16 days ago
2007
Springer
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
150
click to vote
EOR
2006
15 years 6 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
213
click to vote
SI3D
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
152
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
Abstract—In many sensor networks applications, sensors collect correlated measurements of a physical field, e.g., temperature field in a building or in a data center. However, ...