Sciweavers

1448 search results - page 54 / 290
» From Requirements to Code Revisited
Sort
View
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 9 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
VLSID
2009
IEEE
96views VLSI» more  VLSID 2009»
14 years 8 months ago
Efficient Placement of Compressed Code for Parallel Decompression
Code compression is important in embedded systems design since it reduces the code size (memory requirement) and thereby improves overall area, power and performance. Existing res...
Xiaoke Qin, Prabhat Mishra
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 7 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
PLDI
1992
ACM
13 years 11 months ago
Debugging Optimized Code with Dynamic Deoptimization
: SELF's debugging system provides complete source-level debugging (expected behavior) with globally optimized code. It shields the debugger from optimizations performed by th...
Urs Hölzle, Craig Chambers, David Ungar
CORR
2007
Springer
154views Education» more  CORR 2007»
13 years 7 months ago
Distributed Space-Time Codes for Cooperative Networks with Partial CSI
— Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized ...
G. Susinder Rajan, B. Sundar Rajan