2705 search results - page 164 / 541 » Splitting the sensor node |
162
Voted
ECML
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
142
Voted
AAAI
2006
15 years 7 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
150
click to vote
EMNLP
2006
15 years 7 months ago
2006
We study unsupervised methods for learning refinements of the nonterminals in a treebank. Following Matsuzaki et al. (2005) and Prescher (2005), we may for example split NP withou...
164
click to vote
EMNLP
2009
15 years 4 months ago
2009
This paper proposes a novel method to refine the grammars in parsing by utilizing semantic knowledge from HowNet. Based on the hierarchical state-split approach, which can refine ...
146
Voted
GLOBECOM
2006
IEEE
16 years 6 days ago
2006
IEEE
Abstract— In this paper we propose MARAS, a biologicallyinspired method for routing in a mobile ad-hoc/sensor network environment. We assume that all nodes have no explicit knowl...