Sciweavers

2555 search results - page 422 / 511
» Quantifiers and Working Memory
Sort
View
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
15 years 9 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
ESOP
2008
Springer
15 years 9 months ago
Typing Safe Deallocation
In this work we address the problem of proving, by static analysis means, that allocating and deallocating regions in the store provides a safe way to achieve memory management. Th...
Gérard Boudol
217
Voted
AVI
2010
15 years 8 months ago
Deep Diffs: visually exploring the history of a document
Software tools are used to compare multiple versions of a textual document to help a reader understand the evolution of that document over time. These tools generally support the ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
205
Voted
NETWORKING
2010
15 years 8 months ago
Bidirectional Range Extension for TCAM-Based Packet Classification
Abstract. Packet classification is a fundamental task for network devices such as edge routers, firewalls, and intrusion detection systems. Currently, most vendors use Ternary Cont...
Yan Sun, Min Sik Kim
153
Voted
ICONIP
2008
15 years 8 months ago
Improvement of Practical Recurrent Learning Method and Application to a Pattern Classification Task
Practical Recurrent Learning (PRL) has been proposed as a simple learning algorithm for recurrent neural networks[1][2]. This algorithm enables learning with practical order O(n2 )...
Mohamad Faizal Bin Samsudin, Katsunari Shibata