5595 search results - page 783 / 1119 » Approximation Algorithms for Clustering Problems |
184
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
225
click to vote
PVG
2003
IEEE
16 years 15 hour ago
2003
IEEE
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
187
click to vote
DIALM
2003
ACM
16 years 4 hour ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
202
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
150
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...