Sciweavers

2104 search results - page 131 / 421
» Sorting with networks of data structures
Sort
View
JFP
2006
113views more  JFP 2006»
15 years 4 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
WWW
2005
ACM
16 years 5 months ago
Adaptive page ranking with neural networks
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
Franco Scarselli, Sweah Liang Yong, Markus Hagenbu...
162
Voted
JOLLI
2010
142views more  JOLLI 2010»
15 years 3 months ago
Towards a Type-Theoretical Account of Lexical Semantics
After a quick overview of the field of study known as “Lexical Semantics”, where we advocate the need of accessing additional information besides syntax and Montaguestyle sema...
Christian Bassac, Bruno Mery, Christian Retor&eacu...
WCE
2007
15 years 5 months ago
Data Communication and Parallel Computing on Twisted Hypercubes
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...
Emad Abuelrub
136
Voted
DAGM
2006
Springer
15 years 8 months ago
Efficient Algorithms for Similarity Measures over Sequential Data: A Look Beyond Kernels
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
Konrad Rieck, Pavel Laskov, Klaus-Robert Müll...