4171 search results - page 78 / 835 » Distributed Data Structure Design for Scientific Computation |
136
click to vote
IS
2008
15 years 19 days ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
112
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
123
Voted
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
— As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due...
102
Voted
TCS
2010
14 years 11 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
93
Voted
DATAMINE
1999
15 years 9 days ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...