251 search results - page 6 / 51 » When Size Does Matter |
NN
2002
Springer
13 years 7 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
PLDI
1995
ACM
13 years 11 months ago
1995
ACM
When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for ch...
JSAI
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. The economic implications of network topologies are studied via a monopolist’s model of market networks originally proposed by Phan, et al. (2003). By embedding the mar...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Algorithms in distributed information retrieval often rely on accurate knowledge of the size of a collection. The "multiple capture-recapture" method of Shokouhi et al. ...
ACL
2011
12 years 11 months ago
2011
Resolving coordination ambiguity is a classic hard problem. This paper looks at coordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are...