Sciweavers

953 search results - page 162 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
14 years 1 months ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
APN
2008
Springer
13 years 10 months ago
Hierarchical Set Decision Diagrams and Automatic Saturation
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...
Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon
ASPLOS
2008
ACM
13 years 10 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz
CF
2008
ACM
13 years 10 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
CIKM
2008
Springer
13 years 10 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...