Sciweavers

2382 search results - page 316 / 477
» Generating Seeded Trees from Data Sets
Sort
View
PKDD
2000
Springer
151views Data Mining» more  PKDD 2000»
14 years 1 months ago
Discovery of Characteristic subgraph Patterns Using Relative Indexing and the Cascade Model
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
Takashi Okada, Mayumi Oyama
JMLR
2010
230views more  JMLR 2010»
13 years 5 months ago
Learning Dissimilarities for Categorical Symbols
In this paper we learn a dissimilarity measure for categorical data, for effective classification of the data points. Each categorical feature (with values taken from a finite set...
Jierui Xie, Boleslaw K. Szymanski, Mohammed J. Zak...
ICCSA
2003
Springer
14 years 3 months ago
A Probabilistic Model for Predicting Software Development Effort
—Recently, Bayesian probabilistic models have been used for predicting software development effort. One of the reasons for the interest in the use of Bayesian probabilistic model...
Parag C. Pendharkar, Girish H. Subramanian, James ...
KDD
2000
ACM
114views Data Mining» more  KDD 2000»
14 years 1 months ago
Learning Prosodic Patterns for Mandarin Speech Synthesis
Higher quality synthesized speech is required for widespread use of text-to-speech (TTS) technology, and prosodic pattern is the key feature that makes synthetic speech sound unna...
Yiqiang Chen, Wen Gao, Tingshao Zhu
PODC
2009
ACM
14 years 10 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor