Sciweavers

724 search results - page 73 / 145
» Some Structural Complexity Aspects of Neural Computation
Sort
View
GG
2008
Springer
13 years 10 months ago
Graph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
Mathieu Poudret, Agnès Arnould, Jean-Paul C...
AINA
2009
IEEE
14 years 3 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
ACL
2012
11 years 11 months ago
Toward Automatically Assembling Hittite-Language Cuneiform Tablet Fragments into Larger Texts
This paper presents the problem within Hittite and Ancient Near Eastern studies of fragmented and damaged cuneiform texts, and proposes to use well-known text classification metr...
Stephen Tyndall
RT
1998
Springer
14 years 1 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
AI
2008
Springer
13 years 9 months ago
The well-designed young mathematician
This paper complements McCarthy's "The well designed child", in part by putting it in a broader context, the space of possible well designed progeny, and in part by...
Aaron Sloman