32545 search results - page 600 / 6509 » Data Structures and Algorithms |
192
click to vote
SAS
2007
Springer
16 years 1 months ago
2007
Springer
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
207
click to vote
CSSW
2007
15 years 8 months ago
2007
: The SIOC Ontology can be used to express information from the online community sites in a machine-readable form using RDF. This rich data structure allows us to easily analyse an...
189
click to vote
ALGORITHMICA
2005
15 years 7 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
212
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
206
click to vote
TMM
2002
15 years 7 months ago
2002
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...