4744 search results - page 276 / 949 » Connected Computing |
134
click to vote
ECEASST
2010
15 years 1 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
123
click to vote
COLING
2010
14 years 11 months ago
2010
Relations between entities in text have been widely researched in the natural language processing and informationextraction communities. The region connecting a pair of entities (...
153
click to vote
NETWORK
2011
14 years 11 months ago
2011
—Wireless mesh networks (WMNs) promise to extend high-speed wireless connectivity beyond what is possible with the current WiFi-based infrastructure. However, their unique archit...
172
click to vote
ACL
2011
14 years 7 months ago
2011
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
163
click to vote
HAIS
2011
Springer
14 years 7 months ago
2011
Springer
WEKA has recently become a very referenced DM tool. In spite of all the functionality it provides, it does not include any framework for the development of evolutionary algorithms....