1053 search results - page 119 / 211 » Estimating Execution Time of Distributed Applications |
191
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
146
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
119
click to vote
UAI
1990
15 years 4 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
173
click to vote
CIVR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, a motion-based approach for detecting highlevel semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be direc...
116
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
While desktop grids are attractive platforms for executing parallel applications, their volatile nature has often limited their use to so-called “high-throughput” applications...