24 Hits in 4.7 sec


Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer, Patrick K. Nicholson, Mirek Riedewald, Alessandra Sala
2018 Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18  
Given a large graph and a query pattern with node and edge label constraints, a fundamental challenge is to nd the top-k matches ac- cording to a ranking function over edge and node weights.  ...  It can be stopped anytime, but may have to continues until all results are returned. This paper focuses on acyclic patterns over arbitrary labeled graphs.  ...  This work was supported in part by the National Institutes of Health (NIH) under award number R01 NS091421 and by the National Science Foundation (NSF) under award number CAREER III-1762268.  ... 
doi:10.1145/3178876.3186115 pmid:30003197 dblp:conf/www/YangAGNRS18 fatcat:pj7xhfzbcnf3lgk2nmogdvlylm

Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries [article]

Nikolaos Tziavelis, Deepak Ajwani, Wolfgang Gatterbauer, Mirek Riedewald, Xiaofeng Yang
2020 arXiv   pre-print
To this end, we extend classic algorithms that find the k-shortest paths in a weighted graph.  ...  For full conjunctive queries, including cyclic ones, our approach is optimal in terms of the time to return the top result and the delay between results.  ...  This work was supported in part by the National Institutes of Health (NIH) under award number R01 NS091421 and by the National Science Foundation (NSF) under award number CAREER IIS-1762268.  ... 
arXiv:1911.05582v3 fatcat:6o76icz54fhhtcduouv64udvvu

Dependency Parsing

Sandra Kübler, Ryan McDonald, Joakim Nivre
2009 Synthesis Lectures on Human Language Technologies  
current use: transition-based, graph-based, and grammar-based models.  ...  No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means-electronic, mechanical, photocopy, recording, or any other except for brief quotations  ...  The precondition rules out the existence of an arc (w k , r , w i ) in the arc set (for any k and r ).  ... 
doi:10.2200/s00169ed1v01y200901hlt002 fatcat:e6bea7jadrbjjf2mweetf6a6mu

Adaptive learning and mining for data streams and frequent patterns

Albert Bifet
2009 SIGKDD Explorations  
Trees are connected acyclic graphs and they are studied as link-based structures in many cases.  ...  We introduce a general methodology to identify closed patterns in a data stream, using Galois Lattice Theory.  ...  FREQUENT PATTERN MINING Frequent Pattern Mining Patterns are graphs, composed by a labeled set of nodes (vertices) and a labeled set of edges. The number of nodes in a pattern is called its size.  ... 
doi:10.1145/1656274.1656287 fatcat:bgtpeviiijca5mn223gmrptive

Cost-to-Go Function Approximation [chapter]

2017 Encyclopedia of Machine Learning and Data Mining  
Mitchell's, (1982; candidate-elimination algorithm performs a bidirectional search in the hypothesis space.  ...  In: Furukawa K, Cross-References  ...  In this case, the resulting theory is interpreted as a decision list. In the following, we will assume a two-class problem with a positive and a negative class.  ... 
doi:10.1007/978-1-4899-7687-1_100093 fatcat:vse7ncdqs5atlosjhz7fhlj3im

Two particle-in-grid realisations on spacetrees

T. Weinzierl, B. Verleye, P. Henri, D. Roose
2016 Parallel Computing  
Our experiments validate the two schemes at hands of an electrostatic particle-in-cell code by retrieving the dispersion relation of Langmuir waves in a thermal plasma.  ...  We call this cell-based strategy particle in tree (PIT). Our second approach assigns particles to vertices describing a dual grid (PIDT) and augments the lifts and drops with multiscale linked cells.  ...  Bart Verleye was funded by Intel and by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT). All underlying software is open source and available at [31] .  ... 
doi:10.1016/j.parco.2015.12.007 fatcat:6nv33jtfxzcmtodz454n3vm6rq

Data Stream Mining [chapter]

Mohamed Medhat Gaber, Arkady Zaslavsky, Shonali Krishnaswamy
2009 Data Mining and Knowledge Discovery Handbook  
In particular, it implements boosting, bagging, and Hoeffding Trees, all with and without Naïve Bayes classifiers at the leaves.  ...  WEKA is also written in Java.  ...  As before, for any k ∈ (0, 1), we can decompose |μ W 0 −μ W 1 | ≤ cut as Pr[ |μ W 0 −μ W 1 | ≤ cut ] ≤ Pr[ (|μ W 0 − µ W 0 | ≥ k cut ) ∪ (|μ W 1 − µ W 1 | ≥ (1 − k) cut ) ] ≤ Pr[ |μ W 0 − µ W 0 | ≥ k cut  ... 
doi:10.1007/978-0-387-09823-4_39 fatcat:3n27k753zzhidbkjynx7iwmt7e

Search in the Physical World

Geoffrey A. Hollinger
When searching the internet, for instance, success is a matter of informed indexing that allows the information to be retrieved quickly.  ...  In accord with this des [...]  ...  (top) and two example spanning trees of resulting graph (bottom).  ... 
doi:10.1184/r1/6721424.v1 fatcat:p4hus7jugvcp5im2b4ij25bbaq

Analysis of dynamic message passing programs

Damien Zufferey, Thomas A. Henzinger
We give an interpretation of depth-bounded systems as graph-rewriting systems.  ...  We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point.  ...  Then by construction (1) D = ↓ D and (2) all elements in D have tree-depth k. Let (G i ) i∈N be the family of labelled graphs G i = ct(Q i ).  ... 
doi:10.15479/at:ista:1405 fatcat:wlmvggbb2ba75ollrmpk2uv7ae


Fatemeh Almodaresi
Pufferfish provides a full reference index that can return the set of refer- ences, positions and orientations of any k-mer (substring of fixed length "k" ) in the input genomes.  ...  The Pufferfish data structure is based on constructing a compacted, colored, reference de Bruijn graph (ccdbg), and then indexing this structure in an efficient manner.  ...  Performance of the LSM-tree update process starting from an LSM-Tree with k samples and adding batches of samples up to k.  ... 
doi:10.13016/et1e-wjqp fatcat:swca77hvbbgdzdqup3ngzjsyou

Highest order voronoi diagram for region-based spatial query processing

Kiki Maulana Adhinugraha
A spatial query is a mechanism for retrieving objects stored in the database and consists of a specific question with certain parameters in a map.  ...  In general, a spatial query is intended to retrieve the objects either as a set of points of interests or a region for the answer.  ...  spatial query in any k without having to perform a verification step.  ... 
doi:10.4225/03/58b3b5483cd1a fatcat:6h6dyro6qrhzfisw2pvk7x3aka

Trustworthy Cloud Storage

Maxime Augier
Hughes participated in this project in his individual capacity without sponsorship of his employer or any other party.  ...  ,c k , whereas the decoding process can find a unique solution for all the c i , from any k-subset of them.  ...  Six connected components consisting of four vertices, with labels as inFigure 3.4. The eight primes in the top two components are 512 bits long, the other 16 are 256-bit primes).  ... 
doi:10.5075/epfl-thesis-6976 fatcat:kbemxzjulbdlpmmfn3hyssffxy

Practical yet Provably Secure: Complex Database Query Execution over Encrypted Data

Florian Hahn
In this work novel encryption schemes supporting different database query types are presented enabling complex database queries over encrypted data.  ...  For specific constructions enabling exact keyword queries, range queries, database joins and substring queries over encrypted data we prove security in a formal framework, present a theoretical runtime  ...  the encrypted search index but never returned by any k-gram query.  ... 
doi:10.5445/ir/1000091007 fatcat:ypncwftvqrfpvjls7zjtwhq2di

Applied cryptography: Protocols, algorithms, and source code in C

1994 Computer Law and Security Review  
FF (a, b, c, d, M 12 , 7, 0x6b901122) FF (d, a, b, c, M 13 Those constants, t i , were chosen as follows: In step i, t i is the integer part of 2 32 *abs(sin(i)), where i is in radians.  ...  She moves the points around and changes their labels to make a new graph, H.  ...  If DES were pure, then for any K 1 K 2 and K 3 there would always be a K 4 such that E K 3(E K 2(E K 1(P))) = E K 4(P) Triple encryption would be useless.  ... 
doi:10.1016/0267-3649(94)90017-5 fatcat:y5tchirflfdwno7dm4dv6ljx2a

Resolution-based methods for linear temporal reasoning [article]

Martin Suda, Universität Des Saarlandes, Universität Des Saarlandes
It is expected that other implementations would benefit from it in an analogous way.  ...  On the abstract level, this means to develop new algorithms for automated reasoning about properties of systems which evolve in time.  ...  Acknowledgements I was given the opportunity to work on this thesis under a joint supervision provided by the Saarland University, Germany and the Charles University in Prague, Czech Republic.  ... 
doi:10.22028/d291-26627 fatcat:tdjh4vbkzfhfnd6pmirqbvmtcq
« Previous Showing results 1 — 15 out of 24 results