Sciweavers

8719 search results - page 1249 / 1744
» Visualization of Distributed Processes Using
Sort
View
OOPSLA
2007
Springer
16 years 24 days ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
PODC
2005
ACM
16 years 7 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
CLOUD
2010
ACM
15 years 11 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 11 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
TSP
2010
15 years 1 months ago
Statistics of Co-Channel Interference in a Field of Poisson and Poisson-Poisson Clustered Interferers
Abstract--With increasing spatial reuse of radio spectrum, cochannel interference is becoming a dominant noise source and may severely degrade the communication performance of wire...
Kapil Gulati, Brian L. Evans, Jeffrey G. Andrews, ...
« Prev « First page 1249 / 1744 Last » Next »