Sciweavers

5275 search results - page 466 / 1055
» Computing by observing
Sort
View
COLING
2008
15 years 8 months ago
Shift-Reduce Dependency DAG Parsing
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and...
Kenji Sagae, Jun-ichi Tsujii
MASCOTS
2010
15 years 8 months ago
Modeling the Run-time Behavior of Transactional Memory
In this paper, we develop a queuing theory based analytical model to evaluate the performance of transactional memory. Based on the statistical characteristics observed on actual e...
Zhengyu He, Bo Hong
FORTE
2008
15 years 8 months ago
Checking Correctness of Transactional Behaviors
Abstract. The Signal Calculus is an asynchronous process calculus featuring multicast communication. It relies on explicit modeling of the communication structure of the network (c...
Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guan...
ICONIP
2007
15 years 8 months ago
Practical Recurrent Learning (PRL) in the Discrete Time Domain
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
Mohamad Faizal Bin Samsudin, Takeshi Hirose, Katsu...
IJCAI
2007
15 years 8 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé