Sciweavers

11097 search results - page 156 / 2220
» Hera presentation generator
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 10 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
DKE
2010
144views more  DKE 2010»
14 years 10 months ago
Reusing ontologies and language components for ontology generation
Realizing the Semantic Web involves creating ontologies, a tedious and costly challenge. Reuse can reduce the cost of ontology engineering. Semantic Web ontologies can provide use...
Deryle W. Lonsdale, David W. Embley, Yihong Ding, ...
JCIT
2008
128views more  JCIT 2008»
14 years 10 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
ENTCS
2007
91views more  ENTCS 2007»
14 years 10 months ago
Dynamic Reverse Code Generation for Backward Execution
The need for backward execution in debuggers has been raised a number of times. Backward execution helps a user naturally think backwards and, in turn, easily locate the cause of ...
Jooyong Lee
TCAD
1998
154views more  TCAD 1998»
14 years 9 months ago
Address generation for memories containing multiple arrays
This paper presents techniques for generating addresses for memories containing multiple arrays. Because these techniques rely on the inversion or rearrangement of address bits, t...
Herman Schmit, Donald E. Thomas