Sciweavers

4137 search results - page 644 / 828
» On the number of matchings of a tree
Sort
View
JMLR
2010
129views more  JMLR 2010»
13 years 2 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
SPEECH
2010
94views more  SPEECH 2010»
13 years 2 months ago
Predicting the phonetic realizations of word-final consonants in context - A challenge for French grapheme-to-phoneme converters
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
TPDS
2010
164views more  TPDS 2010»
13 years 2 months ago
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation
The basic operation in such a network is the systematic gathering (with or without in-network aggregation) and transmitting of sensed data to a base station for further processing....
Yanwei Wu, Xiang-Yang Li, Yunhao Liu, Wei Lou
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 11 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
ICCV
2011
IEEE
12 years 8 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller