Sciweavers

2060 search results - page 105 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
GRC
2005
IEEE
15 years 3 months ago
Improved rule based rough set approach for target recognition
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
Yong Liu, Congfu Xu, Zhiyong Yan, Yunhe Pan
ESCIENCE
2007
IEEE
15 years 4 months ago
An Integrated Grid Development Environment in Eclipse
With the proliferation of Grid computing, a large number of computational resources are available for solving complex scientific and engineering problems. Nevertheless, it is non-...
Donny Kurniawan, David Abramson
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
15 years 10 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
PDP
2010
IEEE
15 years 4 months ago
Lessons Learnt Porting Parallelisation Techniques for Irregular Codes to NUMA Systems
—This work presents a study undertaken to characterise the behaviour of some parallelisation techniques for irregular codes, previously developed for SMP architectures, on a seve...
Juan Angel Lorenzo, Juan Carlos Pichel, David LaFr...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
15 years 10 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein