4176 search results - page 708 / 836 » Parallelizing Support Vector Machines on Distributed Compute... |
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
DEBS
2003
ACM
15 years 3 months ago
2003
ACM
Event-based computing is vital for the next generation mobile services and applications that need to meet user requirements irrespective of time and location. The event paradigm i...
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
119
click to vote
GPC
2007
Springer
15 years 4 months ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
MIDDLEWARE
2005
Springer
15 years 3 months ago
2005
Springer
Distributed publish/subscribe systems are naturally suited for processing events in distributed systems. However, support for expressing patterns about disparate events and algorit...