597 search results - page 35 / 120 » Dominating Distributions and Learnability |
129
click to vote
ICPP
2002
IEEE
15 years 10 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
134
click to vote
ARC
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper, we present the PARO design tool for the automated hardware synthesis of massively parallel embedded architectures for given dataflow dominant applications....
157
click to vote
ADHOC
2010
15 years 5 months ago
2010
Abstract-- The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology manag...
140
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
145
Voted
ISSE
2006
15 years 5 months ago
2006
Abstract As distributed, networked computing systems become the dominant computing platform in a growing range of applications, they increase opportunities for security violations ...