A Memory-Efficient Algorithm with Level-Order Unary Degree Sequence for Forward Reasoning Engines

2018 ◽  
pp. 59-70
Author(s):  
Hiromu Hiidome ◽  
Yuichi Goto ◽  
Jingde Cheng
Keyword(s):  
Efficient Algorithm ◽  
Degree Sequence ◽  
Forward Reasoning ◽  
Level Order ◽  
Memory Efficient

Memory-efficient algorithm for lens distortion compensation

2003 ◽  
Vol 95 (1) ◽  
pp. 139-141
Author(s):  
K. D. Kozmin ◽  
K. Hyyppä
Keyword(s):  
Efficient Algorithm ◽  
Lens Distortion ◽  
Distortion Compensation ◽  
Memory Efficient

scholarly journals New Results on Degree Sequences of Uniform Hypergraphs

10.37236/3414 ◽  
2013 ◽  
Vol 20 (4) ◽  
Author(s):  
Sarah Behrens ◽  
Catherine Erbes ◽  
Michael Ferrara ◽  
Stephen G. Hartke ◽  
Benjamin Reiniger ◽  
...  
Keyword(s):  
Efficient Algorithm ◽  
Necessary Conditions ◽  
Degree Sequence ◽  
Sufficient Conditions ◽  
Degree Sequences ◽  
Uniform Hypergraph ◽  
Graphic Sequence ◽  
Uniform Hypergraphs ◽  
Open Question

A sequence of nonnegative integers is $k$-graphic if it is the degree sequence of a $k$-uniform hypergraph. The only known characterization of $k$-graphic sequences is due to Dewdney in 1975. As this characterization does not yield an efficient algorithm, it is a fundamental open question to determine a more practical characterization. While several necessary conditions appear in the literature, there are few conditions that imply a sequence is $k$-graphic. In light of this, we present sharp sufficient conditions for $k$-graphicality based on a sequence's length and degree sum.Kocay and Li gave a family of edge exchanges (an extension of 2-switches) that could be used to transform one realization of a 3-graphic sequence into any other realization. We extend their result to $k$-graphic sequences for all $k \geq 3$. Finally we give several applications of edge exchanges in hypergraphs, including generalizing a result of Busch et al. on packing graphic sequences.

A fast and memory efficient algorithm for down-conversion of an HDTV bitstream to an SDTV signal

1999 ◽  
Vol 45 (1) ◽  
pp. 57-61 ◽  
Author(s):  
Wenwu Zhu ◽  
Kyeong Ho Yang ◽  
F.A. Faryar
Keyword(s):  
Efficient Algorithm ◽  
Down Conversion ◽  
Memory Efficient

EFIM: a fast and memory efficient algorithm for high-utility itemset mining

2016 ◽  
Vol 51 (2) ◽  
pp. 595-625 ◽  
Author(s):  
Souleymane Zida ◽  
Philippe Fournier-Viger ◽  
Jerry Chun-Wei Lin ◽  
Cheng-Wei Wu ◽  
Vincent S. Tseng
Keyword(s):  
Efficient Algorithm ◽  
Itemset Mining ◽  
High Utility ◽  
Memory Efficient
Sign in / Sign up

Export Citation Format

Share Document