Filters








200 Hits in 5.8 sec

Table of contents

2021 IEEE transactions on circuits and systems for video technology (Print)  
Li 355 Image/Video Storage and Retrieval Towards Large-Scale Object Instance Search: A Multi-Block N-Ary Trie ................................................... .......................................  ...  Li, and N.  ... 
doi:10.1109/tcsvt.2020.3039667 fatcat:hthz6y3xufak7mc24urgth6poe

To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-tries

Michael J. Steindorfer, Jurgen J. Vinju
2018 Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2018  
In this paper we propose AXIOM, a novel hash-trie data structure that allows for a highly efficient and type-safe multi-map encoding by distinguishing inlined values of singleton sets from nested sets  ...  An immutable multi-map is a many-to-many map data structure with expected fast insert and lookup operations.  ...  Acknowledgments This research has been supported by the NWO TOP-GO grant #612.001.011 łDomain-Specific Languages: A Big Future for Small Programsž and the NWO VICI project #639.023.206 łLanguage Designer's  ... 
doi:10.1145/3192366.3192420 dblp:conf/pldi/SteindorferV18 fatcat:yadtk44qb5gbddv6u2rnid3aji

IntelliCode Compose: Code Generation Using Transformer [article]

Alexey Svyatkovskiy, Shao Kun Deng, Shengyu Fu, Neel Sundaresan
2020 arXiv   pre-print
IntelliCode Compose is deployed as a cloud-based web service.  ...  It makes use of client-side tree-based caching, efficient parallel implementation of the beam search decoder, and compute graph optimizations to meet edit-time completion suggestion requirements in the  ...  A transformer block will typically consist of a multi-head selfattention, followed by a two-layer multi-layer perceptron (MLP) [18] , optionally containing residual connections and layer normalization  ... 
arXiv:2005.08025v2 fatcat:eahcgvn4qjhpflkuzkfh76fgum

InFillmore: Frame-Guided Language Generation with Bidirectional Context [article]

Jiefu Ou, Nathaniel Weir, Anton Belyy, Felix Yu, Benjamin Van Durme
2022 arXiv   pre-print
Our methods flexibly apply to a variety of use scenarios, and we provide a codebase and interactive demo available from https://nlp.jhu.edu/demos/infillmore.  ...  We propose a structured extension to bidirectional-context conditional language generation, or "infilling," inspired by Frame Semantic theory (Fillmore, 1976).  ...  Keskar et al. (2019) train large-scale language models on text prepended with control codes, allowing for guided content and style.  ... 
arXiv:2103.04941v3 fatcat:hfbg7dykpfabjbbnmtcqss4vym

Structured P2P technologies for distributed command and control

Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins
2009 Peer-to-Peer Networking and Applications  
It provides a detailed survey of fundamental design approaches found in modern large-scale P2P systems highlighting design considerations for building and deploying scalable P2P applications.  ...  This paper provides an overview of how P2P systems are capable of providing robust command and control for Distributed Multi-Agent Systems (DMASs).  ...  of searches scales with O( 1 k log 2 N ) hops.  ... 
doi:10.1007/s12083-009-0033-y fatcat:ax5ihdfzfrhqjjqjvcqz266ome

Decomposition based hybrid metaheuristics

Günther R. Raidl
2015 European Journal of Operational Research  
It has been recognized that these concepts may also provide a very fruitful basis for effective hybrid metaheuristics.  ...  This article starts with a general review of design patterns for hybrid approaches that have been successful on many occasions.  ...  Such techniques are generally known as large neighborhood search(Shaw, 1998) or very large-scale neighborhood search (Ahuja et al., 2002) .Many of today's combinations of metaheuristics with MIP approaches  ... 
doi:10.1016/j.ejor.2014.12.005 fatcat:n7qania37rcclf2qoqcajdzope

Trace Reconstruction Problems in Computational Biology [article]

Vinnu Bhardwaj, Pavel A. Pevzner, Cyrus Rashtchian, Yana Safonova
2020 arXiv   pre-print
The problem of reconstructing a string from its error-prone copies, the trace reconstruction problem, was introduced by Vladimir Levenshtein two decades ago.  ...  Perhaps surprisingly, for many classes of trees, such as complete k-ary trees and multi-arm stars (a.k.a. spider trees), a polynomial number of traces suffice for worstcase reconstruction [116] .  ...  After the construction of the trie, all quantities score(C t | s t ) can then be computed by a single Depth-First Search using Eq. (2) .  ... 
arXiv:2010.06083v1 fatcat:xzvtvgbq4bfulbtflap7rzzxsm

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
Second, applications in practice often involve large amounts of data. The inference mechanism should scale up towards large-scale data.  ...  Our objective in this paper is to design a query solution which is capable of handling large-scale city models.  ...  VolUnTeers ICDE-13 would like to extend our warm appreciation to our conference volunteers who assisted before, during and after the conference, to help make sure that everyone enjoys a great conference  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika

STOCK MANAGEMENT AS A CRITICAL SUCCESS FACTOR FOR POLISH CROP PRODCERS

Piotr Korneta
2018 Information System in Management  
Theoretically binary search is equivalent to searching in balanced binary search tree and average performance is O(log n) where n is the number of words (log 2 3953809 = 21,9148117485834 ≈ 22).  ...  , "What are the obstacles that are blocking me?"  ...  Moreover he can see whole outfit, clothes recommended by others as a complementary to searched item.  ... 
doi:10.22630/isim.2018.7.4.21 fatcat:i4gnijrd6vehdmlwv63zr4nsaq

A Layered Aggregate Engine for Analytics Workloads

Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen
2019 Proceedings of the 2019 International Conference on Management of Data - SIGMOD '19  
, Scikit, R, and AC/DC for learning a variety of models over databases.  ...  The primary motivation for this work stems from the observation that for a variety of analytics over databases, their data-intensive tasks can be decomposed into groupby aggregates over the join of the  ...  A final example is that of an exponential n-ary function f i11 (X 1 , . . . , X n ) = e j ∈[n] θ j ·X j , which is used for logistic regression.  ... 
doi:10.1145/3299869.3324961 dblp:conf/sigmod/SchleichOK0N19 fatcat:irgddsq4ufc6rgiy6auncytpri

A Survey of RDF Stores SPARQL Engines for Querying Knowledge Graphs [article]

Waqas Ali, Muhammad Saleem, Bin Yao, Aidan Hogan, Axel-Cyrille Ngonga Ngomo
2021 arXiv   pre-print
techniques for efficiently evaluating SPARQL queries in a local setting (on one machine).  ...  This survey paper provides a comprehensive review of techniques and systems for querying RDF knowledge graphs.  ...  ., paths between two subject/object nodes -in large RDF graphs. This path-search functionality was implemented in BRAHMS using depth-first search and breadth-first search algorithms.  ... 
arXiv:2102.13027v4 fatcat:phontczhbfcvdjt5y75n3hfcge

A case-based assistant for diagnosis and analysis of dysmorphic syndromes

CD. Evans
1995 Medical Informatics  
In this instance, the case would have a link from the p a r e n t slot of its header object to the c h ild r e n slot of the relevant syndrome header object.  ...  , when used w ith the R e trie v e program , returns the case-base objects listed in Table 7 .7.  ...  P erm an en t N o n -perm anent N1 (craninm general ae ro /tu rric e p h a ly ) (cran in m general brachycephaly) (cran in m cranial-»ntnre» cranio»yno»to»i») (eye» general h y perteloriim ) (face general  ... 
doi:10.3109/14639239509025350 pmid:8569305 fatcat:yw6qpzunjrecxfsrrhabvtdoti

Research on File and I/O Systems at the University of California, Berkeley

Alan Jay Smith
1982 IEEE Data Engineering Bulletin  
In a recently completed study, a new approach to the cost/benefit analysis of DBMSs was proposed as a way to simplify the problem of determining which database management system, out of a number of candidate  ...  s Database Research and Development Center is actively engaged in a number of diverse projects in the database area.  ...  The tree is expanded, using breadth-first search, to level EL, and we keep on].y the best N solutions.  ... 
dblp:journals/debu/Smith82 fatcat:7tzeha7fq5g6npja26ofl3lhrq

Constraints meet concurrency

Jacopo Mauro
2015 Constraints  
Then we propose a framework to solve constraint problems that is intended to be deployed on a concurrent system.  ...  Firstly we study the expressive power of a concurrent language, namely Constraint Handling Rules, that supports constraints as a primitive construct.  ...  ; 2-ary-int instances involving intensionally defined binary (and unary) constraints; n-ary-int instances involving intensionally defined constraints, at least one of which is defined over more than two  ... 
doi:10.1007/s10601-015-9218-6 fatcat:7cjwl2p4anfkvbpahjnklrs7my

Towards a natural language processing pipeline and search engine for biomedical associations derived from scientific literature

Dieter Galea, Kirill Veselkov, Zoltan Takats, Imperial College London
2020
Latter work indicates that current recognition models are poorly generalizable, resulting in unrealistic performance when applied at scale.  ...  To achieve a diverse association extraction pipeline for 10 entity types, we attempt to find a balance between generalizable rules and ML models.  ...  This has the clear advantage of being highly generalizable and therefore scales to a large number of entity classes.  ... 
doi:10.25560/83109 fatcat:f4ntlogk6retxctpj3hx357gvm
« Previous Showing results 1 — 15 out of 200 results