288 search results - page 15 / 58 » Ripple presentation for tree structures with historical info... |
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...
CC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
COMAD
2009
13 years 8 months ago
2009
In this paper, we present a feasibility study in automating the insurance claims processing system related to automotive sector. In automobile insurance claims processing, usually...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
ICANN
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...