Sciweavers

2350 search results - page 363 / 470
» A Reflective Approach to Providing Flexibility in Applicatio...
Sort
View
CCGRID
2003
IEEE
15 years 11 months ago
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
Farnoush Banaei Kashani, Cyrus Shahabi
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 10 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
ICMLA
2009
15 years 4 months ago
Alive on Back-feed Culprit Identification via Machine Learning
We describe an application of machine learning techniques toward the problem of predicting which network protector switch is the cause of an Alive on Back-Feed (ABF) event in the ...
Bert C. Huang, Ansaf Salleb-Aouissi, Philip Gross
CIKM
2008
Springer
15 years 8 months ago
SoRec: social recommendation using probabilistic matrix factorization
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
SPAA
1996
ACM
15 years 10 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher