2104 search results - page 79 / 421 » Sorting with networks of data structures |
139
Voted
APPINF
2003
15 years 5 months ago
2003
Whenever large homogeneous data structures need to be processed in a non-trivial way, e.g. in computational sciences, image processing, or system simulation, high-level array prog...
145
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
152
click to vote
MP
2010
15 years 2 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
126
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
113
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...