Sciweavers

1265 search results - page 20 / 253
» Finding the Key to a Synapse
Sort
View
CIKM
2008
Springer
13 years 9 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
RECOMB
2009
Springer
14 years 8 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
JCSS
2008
87views more  JCSS 2008»
13 years 7 months ago
Finding large 3-free sets I: The small n case
There has been much work on the following question: given n, how large can a subset of {1, . . . , n} be that has no arithmetic progressions of length 3. We call such sets 3-free....
William I. Gasarch, James Glenn, Clyde P. Kruskal
JUCS
2002
131views more  JUCS 2002»
13 years 7 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
HICSS
2006
IEEE
100views Biometrics» more  HICSS 2006»
14 years 1 months ago
The Impact of Social Types within Information Communities: Findings from Technical Newsgroups
We explored whether Fisher and Durrance’s [11] framework of information communities applies to online technical newsgroups and the impact of particular social types on informati...
Tammara Combs Turner, Karen E. Fisher