Sciweavers

564 search results - page 54 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
14 years 10 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
ICDE
2004
IEEE
133views Database» more  ICDE 2004»
15 years 11 months ago
GenExplore: Interactive Exploration of Gene Interactions from Microarray Data
DNA Microarray provides a powerful basis for analysis of gene expression. Data mining methods such as clustering have been widely applied to microarray data to link genes that sho...
Yong Ye, Xintao Wu, Kalpathi R. Subramanian, Liyin...
TCS
1998
14 years 9 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
VTC
2006
IEEE
15 years 3 months ago
Soft Detection with Linear Precoding for Spatial Multiplexing Systems
— We present a precoded reduced-complexity soft detection (PRCSD) algorithm for spatial multiplexing systems. The linear operations at both transmit and receive sides based on co...
Yong Li, Jaekyun Moon
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
15 years 10 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...