427 search results - page 28 / 86 » Computing the Local Consensus of Trees |
163
click to vote
EWSN
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. T...
136
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
164
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
176
click to vote
ML
2000
ACM
15 years 4 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
149
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...