Sciweavers

3600 search results - page 349 / 720
» The settling-time reducibility ordering
Sort
View
ASPLOS
2010
ACM
15 years 10 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...
AAAI
1998
15 years 8 months ago
Learning Investment Functions for Controlling the Utility of Control Knowledge
The utility problem occurs when the cost of the acquired knowledge outweighs its bene ts. When the learner acquires control knowledge for speeding up a problem solver, the bene t ...
Oleg Ledeniov, Shaul Markovitch
ANLP
1997
137views more  ANLP 1997»
15 years 8 months ago
Probabilistic and Rule-Based Tagger of an Inflective Language- a Comparison
We present results of probabilistic tagging of Czech texts in order to show how these techniques work for one of the highly morphologically ambiguous inflective languages. After d...
Jan Hajic, Barbora Hladká
NN
1998
Springer
108views Neural Networks» more  NN 1998»
15 years 6 months ago
How embedded memory in recurrent neural network architectures helps learning long-term temporal dependencies
Learning long-term temporal dependencies with recurrent neural networks can be a difficult problem. It has recently been shown that a class of recurrent neural networks called NA...
Tsungnan Lin, Bill G. Horne, C. Lee Giles
PVLDB
2008
110views more  PVLDB 2008»
15 years 6 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons