255 search results - page 3 / 51 » An Efficient Algorithm for Computing Hypervolume Contributio... |
FATES
2006
Springer
13 years 11 months ago
2006
Springer
We present a new lockset-based algorithm, Goldilocks, for precisely computing the happens-before relation and thereby detecting data-races at runtime. Dynamic race detection algori...
DAGM
2006
Springer
13 years 11 months ago
2006
Springer
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
DIS
2004
Springer
13 years 11 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...