Sciweavers

4541 search results - page 178 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
15 years 7 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
DAGSTUHL
2007
15 years 4 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst
DAC
2003
ACM
16 years 4 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
AMC
2008
87views more  AMC 2008»
15 years 3 months ago
Mining classification rules with Reduced MEPAR-miner Algorithm
In this study, a new classification technique based on rough set theory and MEPAR-miner algorithm for association rule mining is introduced. Proposed method is called as `Reduced ...
Emel Kizilkaya Aydogan, Cevriye Gencer
WWW
2003
ACM
16 years 3 months ago
Techniques and Metrics for Improving Website Structure
In this work two distinct metrics are proposed, which aim to quantify the importance of a web page based on the visits it receives by the users and its location within the website...
Eleni Christopoulou, John D. Garofalakis, Christos...