4679 search results - page 185 / 936 » Modeling When Connections Are the Problem |
121
click to vote
EMNLP
2010
14 years 12 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...
ICALT
2008
IEEE
15 years 8 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ļ...
97
Voted
ICDCSW
2008
IEEE
15 years 8 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...
110
click to vote
PIMRC
2008
IEEE
15 years 8 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...
98
Voted
COCOON
2005
Springer
15 years 7 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 ...