7015 search results - page 1053 / 1403 » Approximation algorithms for co-clustering |
162
click to vote
COR
2006
15 years 6 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
218
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
188
click to vote
CGF
2007
15 years 6 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
211
click to vote
JAIR
2008
15 years 6 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...