default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 89
Volume 89, November 2017
- Dawei Sun, Guangyan Zhang
, Chengwen Wu, Keqin Li, Weimin Zheng:
Building a fault tolerant framework with deadline guarantee in big data stream computing environments. 4-23 - Alireza Khoshkbarforoushha, Alireza Khosravian, Rajiv Ranjan:
Elasticity management of Streaming Data Analytics Flows on clouds. 24-40 - Zhiwei Wang, Cheng Cao, Nianhua Yang, Victor Chang:
ABE with improved auxiliary input for big data security. 41-50 - Cheng Huang, Rongxing Lu, Kim-Kwang Raymond Choo:
Secure and flexible cloud-assisted association rule mining over horizontally partitioned databases. 51-63 - Wei Liang, Chunhua Hu, Min Wu, Qun Jin:
A data intensive heuristic approach to the two-stage streaming scheduling problem. 64-79 - Tong Li, Zheli Liu, Jin Li, Chunfu Jia, Kuan-Ching Li:
CDPS: A cryptographic data publishing system. 80-91 - Guoqing Xiao, Kenli Li, Xu Zhou, Keqin Li:
Efficient monochromatic and bichromatic probabilistic reverse top-k query processing for uncertain big data. 92-113 - Aly Ahmed, Alex Thomo:
Computing source-to-target shortest paths for complex networks in RDBMS. 114-129 - Weijing Song, Lizhe Wang, Yang Xiang, Albert Y. Zomaya:
Geographic spatiotemporal big data correlation analysis via the Hilbert-Huang transformation. 130-141
- Shifeng Sun, Dawu Gu, Udaya Parampalli, Yu Yu, Baodong Qin:
Public key encryption resilient to leakage and tampering attacks. 142-156 - Hadas Shachnai, Meirav Zehavi:
A multivariate framework for weighted FPT algorithms. 157-189 - Xueqing Gong, Chi Wan Sung:
Zigzag Decodable codes: Linear-time erasure codes with applications to data storage. 190-208 - Sergio Abriola, María Emilia Descotte, Raul Fervari, Santiago Figueira:
Axiomatizations for downward XPath on data trees. 209-245 - Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim:
Disjoint path covers with path length constraints in restricted hypercube-like graphs. 246-269 - Janusz A. Brzozowski, Marek Szykula:
Complexity of suffix-free regular languages. 270-287 - Ville Salo:
Decidability and universality of quasiminimal subshifts. 288-314 - Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A polynomial-time algorithm for Outerplanar Diameter Improvement. 315-327 - Iain A. Stewart:
On the combinatorial design of data centre network topologies. 328-348 - George Barmpalias, Andrew Lewis-Pye:
Differences of halting probabilities. 349-360 - Yuan Feng, Lijun Zhang:
Precisely deciding CSL formulas through approximate model checking for CTMCs. 361-371 - Benoît Groz, Sebastian Maneth:
Efficient testing and matching of deterministic regular expressions. 372-399 - Kaibin Huang, Raylin Tso, Yu-Chi Chen:
Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption. 400-409 - Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring diamond-free graphs. 410-431 - Yongjie Yang, Jiong Guo:
The control complexity of r-Approval: From the single-peaked case to the general case. 432-449 - Yann Guermeur:
Lp-norm Sauer-Shelah lemma for margin multi-category classifiers. 450-473
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-18 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
