Sciweavers

1270 search results - page 238 / 254
» Improving Code Density Using Compression Techniques
Sort
View
OOPSLA
2010
Springer
13 years 6 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
HPCN
2000
Springer
14 years 7 days ago
A Java-Based Parallel Programming Support Environment
The Java programming language and environment is stimulating new research activities in many areas of computing, not the least of which is parallel computing. Parallel techniques ...
Kenneth A. Hawick, Heath A. James
CASES
2010
ACM
13 years 6 months ago
Low cost multicast authentication via validity voting in time-triggered embedded control networks
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
Christopher Szilagyi, Philip Koopman
ICIP
2005
IEEE
14 years 10 months ago
Fuzzy image segmentation of generic shaped clusters
Abstract The segmentation performance of any clustering algorithm is very sensitive to the features in an image, which ultimately restricts their generalization capability. This li...
Mohammed Ameer Ali, Gour C. Karmakar, Laurence S. ...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle