Sciweavers

522 search results - page 82 / 105
» What's a Typical Commit
Sort
View
SIGUCCS
2000
ACM
14 years 3 hour ago
Supporting PeopleSoft in an Academic Environment: Pitbull or Poodle?
Over the past decade, distributed computing necessitated a centralized support environment at most colleges and universities. This development has given campus computer users the ...
Jen Whiting, Gary Eshbaugh
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 9 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
OPODIS
2007
13 years 9 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
WSC
2000
13 years 9 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
EMNLP
2009
13 years 5 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner