Sciweavers

6251 search results - page 126 / 1251
» Randomness, Computability, and Density
Sort
View
92
Voted
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
16 years 1 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
97
Voted
IPPS
2000
IEEE
15 years 5 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco
101
Voted
ICPR
2002
IEEE
15 years 5 months ago
Extracting Fractal Features for Analyzing Protein Structure
This paper is concerned with the development of a computational methodology based on fractal geometry for determining 3D structure of protein with imagery projection operations. I...
Yu Tao, Thomas R. Ioerger, James C. Sacchettini
APAL
2010
125views more  APAL 2010»
15 years 25 days ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
133
Voted
DAC
2003
ACM
16 years 1 months ago
Performance-impact limited area fill synthesis
Chemical-mechanical planarization (CMP) and other manufacturing steps in very deep-submicron VLSI have varying effects on device and interconnect features, depending on the local ...
Yu Chen, Puneet Gupta, Andrew B. Kahng