1802 search results - page 212 / 361 » Complexity Theory for Operators in Analysis |
172
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
181
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We are interested in engineering smart machines that enable backtracking of emergent behaviors. Our SSNNS simulator consists of hand-picked tools to explore spiking neural network...
242
click to vote
TCS
2008
15 years 6 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
166
click to vote
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
171
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...