Sciweavers

1313 search results - page 150 / 263
» Data Discretization Unification
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 7 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 7 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
ICDM
2008
IEEE
224views Data Mining» more  ICDM 2008»
14 years 4 months ago
A Non-parametric Approach to Pair-Wise Dynamic Topic Correlation Detection
We introduce dynamic correlated topic models (DCTM) for analyzing discrete data over time. This model is inspired by the hierarchical Gaussian process latent variable models (GP-L...
Yang Song, Lu Zhang 0007, C. Lee Giles
APCCAS
2006
IEEE
258views Hardware» more  APCCAS 2006»
14 years 4 months ago
A 12-bit CMOS Current Steering D/A Converter for Embedded Systems
Abstract - This paper describes the design of a 12-bit digital-to-analog converter for a wireline modem chip implemented in a 0.13tm digital CMOS technology. Transistor-level simul...
Jesús Ruiz-Amaya, Manuel Delgado-Restituto,...
MCS
2004
Springer
14 years 3 months ago
A Probabilistic Model Using Information Theoretic Measures for Cluster Ensembles
Abstract. This paper presents a probabilistic model for combining cluster ensembles utilizing information theoretic measures. Starting from a co-association matrix which summarizes...
Hanan Ayad, Otman A. Basir, Mohamed Kamel