7006 search results - page 1008 / 1402 » Approximation Algorithms |
145
click to vote
STACS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
169
click to vote
IMR
2004
Springer
16 years 4 days ago
2004
Springer
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
154
click to vote
PVM
2004
Springer
16 years 4 days ago
2004
Springer
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
189
click to vote
WAOA
2004
Springer
16 years 3 days ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
162
click to vote
ECCV
2010
Springer
16 years 3 days ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...