자료유형 | E-Book |
---|---|
개인저자 | Zhou, Samson. |
단체저자명 | Purdue University. Computer Sciences. |
서명/저자사항 | Approximating Properties of Data Streams. |
발행사항 | [S.l.] : Purdue University., 2018 |
발행사항 | Ann Arbor : ProQuest Dissertations & Theses, 2018 |
형태사항 | 135 p. |
소장본 주기 | School code: 0183. |
ISBN | 9780438018822 |
일반주기 |
Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Advisers: Greg N. Frederickson |
요약 | In this dissertation, we present algorithms that approximate properties in the data stream model, where elements of an underlying data set arrive sequentially, but algorithms must use space sublinear in the size of the underlying data set. |
요약 | We first study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n-p differs from its suffix of length n-p in at most k locations. We give algorithms to |
요약 | We then study the problem of identifying a longest substring of strings S and T of length n that forms a d-near-alignment under the edit distance, in the simultaneous streaming model. In this model, symbols of strings S and T are streamed at t |
요약 | We then consider the distinct elements and lP problems in the sliding window model, where only the most recent n elements in the data stream form the underlying set. We first introduce the composable histogram , a simple twist on the exponentia |
요약 | Finally, we consider the problem of estimating the maximum weighted matching of a graph whose edges are revealed in a streaming fashion. We develop a reduction from the maximum weighted matching problem to the maximum cardinality matching proble |
일반주제명 | Computer science. |
언어 | 영어 |
기본자료 저록 | Dissertation Abstracts International79-10B(E). Dissertation Abstract International |
대출바로가기 | http://www.riss.kr/pdu/ddodLink.do?id=T14997908 |
인쇄
No. | 등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
---|---|---|---|---|---|---|---|---|
1 | WE00027121 | 004 | 가야대학교/전자책서버(컴퓨터서버)/ | 대출가능 |