4176 search results - page 378 / 836 » Parallelizing Support Vector Machines on Distributed Compute... |
154
click to vote
HPDC
2002
IEEE
15 years 11 months ago
2002
IEEE
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
172
click to vote
EUROPAR
2003
Springer
16 years 1 days ago
2003
Springer
The process of design search and optimisation is characterised by its computationally intensive operations, which produce a problem well suited to Grid computing. Here we present a...
210
click to vote
ICDT
2001
ACM
15 years 11 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
185
click to vote
INTERNET
2007
15 years 6 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
168
click to vote
NIPS
2007
15 years 8 months ago
2007
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...