12453 search results - page 287 / 2491 » Concurrent Data Structures |
183
click to vote
COLING
2010
15 years 1 months ago
2010
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...
175
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
124
click to vote
ROBOCUP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. This paper proposes a novel method for supervised classification based on the methodology of Q-analysis. The classification is based on finding ‘relevant’ structur...
184
click to vote
MVA
2010
15 years 5 months ago
2010
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
154
click to vote
DAGSTUHL
1998
15 years 8 months ago
1998
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...