4679 search results - page 185 / 936 » Modeling When Connections Are the Problem |
162
click to vote
EMNLP
2010
15 years 3 months ago
2010
We reveal a previously unnoticed connection between dependency parsing and statistical machine translation (SMT), by formulating the dependency parsing task as a problem of word a...
115
click to vote
ICALT
2008
IEEE
15 years 11 months ago
2008
IEEE
Although the notion of generality is central in mathematics and science, being able to identify and express general patterns and/or articulating structures is one of the main difļ...
128
click to vote
ICDCSW
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a new control method to cover the āholesā in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
153
click to vote
PIMRC
2008
IEEE
15 years 11 months ago
2008
IEEE
āIn this paper, we propose a new control method to cover āholesā in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are dis...
127
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ā E iļ¬ u and v are connected by a path of length at most k in T. The tree T ...