Information bounds are good for search problems on ordered data structures

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) ◽

10.1109/sfcs.1983.27 ◽

1983 ◽

Cited By ~ 3

Author(s):

Nathan Linial ◽

Michael E. Saks

Keyword(s):

Data Structures ◽

Search Problems ◽

Good For ◽

Ordered Data

Download Full-text

Forensic analysis of ordered data structures on the example of JPEG files

2012 IEEE International Workshop on Information Forensics and Security (WIFS) ◽

10.1109/wifs.2012.6412639 ◽

2012 ◽

Cited By ~ 11

Author(s):

Thomas Gloe

Keyword(s):

Data Structures ◽

Forensic Analysis ◽

Ordered Data

Download Full-text

Integrity verification of the ordered data structures in manipulated video content

Digital Investigation ◽

10.1016/j.diin.2016.06.001 ◽

2016 ◽

Vol 18 ◽

pp. 1-7 ◽

Cited By ~ 9

Author(s):

Jieun Song ◽

Kiryong Lee ◽

Wan Yeon Lee ◽

Heejo Lee

Keyword(s):

Data Structures ◽

Video Content ◽

Integrity Verification ◽

Ordered Data

Download Full-text

Concurrent processing of linearly ordered data structures on hypercube multicomputers

IEEE Transactions on Parallel and Distributed Systems ◽

10.1109/71.308529 ◽

1994 ◽

Vol 5 (9) ◽

pp. 898-911 ◽

Cited By ~ 1

Author(s):

J. Ghosh ◽

S.K. Das ◽

A. John

Keyword(s):

Data Structures ◽

Concurrent Processing ◽

Ordered Data

Download Full-text

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems

Algorithmica ◽

10.1007/s00453-009-9355-7 ◽

2009 ◽

Vol 60 (3) ◽

pp. 505-552 ◽

Cited By ~ 23

Author(s):

Michael T. Goodrich ◽

Roberto Tamassia ◽

Nikos Triandopoulos

Keyword(s):

Data Structures ◽

Graph Connectivity ◽

Search Problems ◽

Geometric Search ◽

Authenticated Data Structures

Download Full-text

Traits of Interval Tree in Solving Blind Search Problems of Finding a Term in an Ordered Data Set

International Journal of Information and Education Technology ◽

10.18178/ijiet.2020.10.7.1417 ◽

2020 ◽

Vol 10 (7) ◽

pp. 516-522

Author(s):

Xingbo Wang ◽

◽

Jicong Wu

Keyword(s):

Search Problems ◽

Data Set ◽

Interval Tree ◽

Blind Search ◽

Ordered Data

Download Full-text

Seti Figure of Merit

International Astronomical Union Colloquium ◽

10.1017/s0252921100015293 ◽

1997 ◽

Vol 161 ◽

pp. 711-717 ◽

Cited By ~ 1

Author(s):

John W. Dreher ◽

D. Kent Cullers

Keyword(s):

Figure Of Merit ◽

Qualitative Difference ◽

Current Generation ◽

Detection Range ◽

Sky Surveys ◽

Independent Observations ◽

Good For

AbstractWe develop a figure of merit for SETI observations which is anexplicitfunction of the EIRP of the transmitters, which allows us to treat sky surveys and targeted searches on the same footing. For each EIRP, we calculate the product of terms measuring the number of stars within detection range, the range of frequencies searched, and the number of independent observations for each star. For a given set of SETI observations, the result is a graph of merit versus transmitter EIRP. We apply this technique to several completed and ongoing SETI programs. The results provide a quantitative confirmation of the expected qualitative difference between sky surveys and targeted searches: the Project Phoenix targeted search is good for finding transmitters in the 109to 1014W range, while the sky surveys do their best at higher powers. Current generation optical SETI is not yet competitive with microwave SETI.

Download Full-text