A Design Of Gs1 Epcglobal Application Level Events Extension For Iot Applications | 2 | 0.45 | 2016 |
Complex sensing event process of IoT application based on epcglobal architecture and IEEE 1451 | 2 | 0.45 | 2012 |
A Novel Construction Method For N-Dimensional Hilbert Space-Filling Curves | 0 | 0.34 | 2010 |
A practice of ESL verification methodology from SystemC to FPGA: using EPC class-1 generation-2 RFID tag design as an example | 1 | 0.36 | 2010 |
An integrated information system for real estate agency-based on service-oriented architecture. | 9 | 0.95 | 2009 |
A Service-Oriented Architecture Based Vendor Managed Inventory System | 0 | 0.34 | 2008 |
Lossless compression of medical images using Hilbert space-filling curves. | 4 | 0.44 | 2008 |
Efficient Searching Algorithms for Multi-Dimensional Space Data Using Hilbert Space-Filling Curves | 0 | 0.34 | 2008 |
A Rule-Based Disease Diagnostic System Using a Temporal Relationship Model | 2 | 0.47 | 2007 |
Algebraic Specification and Program Synthesis for Computing Hilbert Space-Filling Curve Indices | 0 | 0.34 | 2007 |
A Multi-Role Collaborative Method and Platform for Developing Software Requirements | 0 | 0.34 | 2006 |
A Programming Methodology for Designing Block Recursive Algorithms | 0 | 0.34 | 2006 |
Quantum Gates Revisited: A Tensor Product Based Interpretation Model | 0 | 0.34 | 2004 |
Algebraic Formulation And Program Generation Of Three-Dimensional Hilbert Space-Filling Curves | 0 | 0.34 | 2004 |
Tensor product formulation for Hilbert space-filling curves | 5 | 0.49 | 2003 |
A programming methodology for designing block recursive algorithms on various computer networks | 0 | 0.34 | 2002 |
A programming methodology for designing parallel prefix algorithms | 5 | 0.46 | 2001 |
Efficient index generation for compiling two-level mappings in data-parallel programs | 2 | 0.40 | 2000 |
Languages and Compilers for Parallel Computing, 10th International Workshop, LCPC'97, Minneapolis, Minnesota, USA, August 7-9, 1997, Proceedings | 31 | 3.70 | 1998 |
A Technique For Overlapping Computation And Communication For Block Recursive Algorithms | 4 | 0.46 | 1998 |
Reuse-driven tiling for improving data locality | 17 | 0.78 | 1998 |
Table-Lookup Approach for Compiling Two-Level Data-Processor Mappings in HPF | 3 | 0.38 | 1997 |
Reuse-Driven Tiling for Data Locality | 18 | 1.08 | 1997 |
Statement-Level Communication-Free Partitioning Techniques for Parallelizing Compilers | 8 | 0.55 | 1996 |
Languages and Compilers for Parallel Computing, 8th International Workshop, LCPC'95, Columbus, Ohio, USA, August 10-12, 1995, Proceedings | 38 | 3.58 | 1996 |
Compiling Array Statements for Efficient Execution on Distributed-Memory Machines: Two-Level Mappings | 4 | 0.54 | 1995 |
A Clustering Algorithm for Parallel Sparse Cholesky Factorization | 1 | 0.35 | 1995 |
Multi-phase array redistribution: modeling and evaluation | 38 | 1.50 | 1995 |
Incremental Generation of Index Sets for Array Statement Execution on Distributed-Memory Machines | 4 | 0.54 | 1994 |
Implementing Fast Fourier Transforms on Distributed-Memory Multiprocessors Using Data Redistributions | 7 | 0.68 | 1994 |
Communication-Efficient Implementation of Block Recursive Algorithms on Distributed-Memory Machines | 1 | 0.37 | 1994 |
Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors | 1 | 0.42 | 1993 |
An Algebraic Theory for Modeling Multistage Interconnection Networks | 9 | 1.40 | 1993 |
A Methodology for Generating Efficient Disk-Based Algorithms from Tensor Product Formulas | 3 | 0.60 | 1993 |
On the Synthesis of Parallel Programs from Tensor Product Formulas for Block Recursive Algorithms | 2 | 0.37 | 1992 |
A methodology for generating data distributions to optimize communication | 9 | 2.16 | 1992 |
Generating Parallel Programs from Tensor Product Formulas: A Case Study of Strassen's Matrix Multiplication Algorithm | 15 | 2.45 | 1992 |
On The Synthesis Of Programs For Various Parallel Architectures | 1 | 0.36 | 1991 |
The Derivation of Systolic Implementations of Programs | 23 | 2.79 | 1987 |
A mechanically certified theorem about optimal concurrency of sorting networks | 9 | 2.03 | 1986 |
The Static Derivation of Concurrency and its Mechanzed Certification | 3 | 0.73 | 1984 |