Sciweavers

686 search results - page 80 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 8 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 2 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 2 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile