Sciweavers

983 search results - page 134 / 197
» A Better Update Policy
Sort
View
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 2 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
ICCS
2004
Springer
14 years 2 months ago
Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
Luciano José Senger, Marcos José San...
WDAG
2004
Springer
134views Algorithms» more  WDAG 2004»
14 years 2 months ago
An Optimistic Approach to Lock-Free FIFO Queues
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
Edya Ladan-Mozes, Nir Shavit
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 2 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
JCDL
2003
ACM
80views Education» more  JCDL 2003»
14 years 2 months ago
Repository Synchronization in the OAI Framework
The Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH) began as an alternative to distributed searching of scholarly eprint repositories. The model embraced by th...
Xiaoming Liu 0005, Kurt Maly, Mohammad Zubair, Mic...