Sciweavers

550 search results - page 110 / 110
» Supporting plan authoring and analysis
Sort
View
CN
2010
121views more  CN 2010»
13 years 1 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
CORR
2011
Springer
183views Education» more  CORR 2011»
12 years 12 months ago
Automatic Network Fingerprinting through Single-Node Motifs
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...
Christoph Echtermeyer, Luciano da Fontoura Costa, ...
CHI
2011
ACM
12 years 8 months ago
Improving the safety of homeless young people with mobile phones: values, form and function
By their pervasiveness and by being worn on our bodies, mobile phones seem to have become intrinsic to safety. To examine this proposition, 43 participants, from four stakeholder ...
Jill Palzkill Woelfer, Amy Iverson, David G. Hendr...
CSCW
2012
ACM
12 years 19 days ago
Blogs as a collective war diary
Disaster-related research in human-centered computing has typically focused on the shorter-term, emergency period of a disaster event, whereas effects of some crises are longterm,...
Gloria Mark, Mossaab Bagdouri, Leysia Palen, James...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 4 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger