Sciweavers

58 search results - page 8 / 12
» Competitive Freshness Algorithms for Wait-Free Data Objects
Sort
View
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an eï¬...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld
JMLR
2010
110views more  JMLR 2010»
13 years 2 months ago
Attribute Selection Based on FRiS-Compactness
Commonly to classify new object in Data Mining one should estimate its similarity with given classes. Function of Rival Similarity (FRiS) is assigned to calculate quantitative mea...
Nikolay G. Zagoruiko, Irina V. Borisova, Vladimir ...
ICDIM
2008
IEEE
14 years 2 months ago
A holographic associative memory recommender system
We describe a recommender system based on Dynamically Structured Holographic Memory (DSHM), a cognitive model of associative memory that uses holographic reduced representations a...
Matthew Rutledge-Taylor, Andre Vellino, Robert L. ...
TCAD
2002
135views more  TCAD 2002»
13 years 7 months ago
Area fill synthesis for uniform layout density
Chemical-mechanical polishing (CMP) and other manufacturing steps in very deep submicron VLSI have varying effects on device and interconnect features, depending on local character...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 7 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...