Sciweavers

2168 search results - page 102 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
214
Voted
IDA
2011
Springer
14 years 10 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
115
Voted
IJOE
2008
98views more  IJOE 2008»
15 years 3 months ago
OpenLabs Security Laboratory - The Online Security Experiment Platform
For experiments to be reproducible, it is important to have a known and controlled environment. This requires isolation from the surroundings. For security experiments, e.g. with h...
Johan Zackrisson, Charlie Svahnberg
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 10 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
146
Voted
ACIVS
2006
Springer
15 years 9 months ago
Dedicated Hardware for Real-Time Computation of Second-Order Statistical Features for High Resolution Images
We present a novel dedicated hardware system for the extraction of second-order statistical features from high-resolution images. The selected features are based on gray level co-o...
Dimitris G. Bariamis, Dimitrios K. Iakovidis, Dimi...
141
Voted
HPDC
2007
IEEE
15 years 10 months ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...