46,423 Hits in 4.0 sec

Generating Representative Executions [Extended Abstract]

Hendrik Maarand, Tarmo Uustalu
2017 Electronic Proceedings in Theoretical Computer Science  
This problem can be alleviated by applying the theory of Mazurkiewicz traces to focus only on the canonical representatives of the equivalence classes of the possible executions of the program.  ...  Analyzing the behaviour of a concurrent program is made difficult by the number of possible executions.  ...  The third condition picks a permutation of a step as a representative of the step.  ... 
doi:10.4204/eptcs.246.8 fatcat:2hfbndtzxzfdhhidabilmgxfr4

Forgetting Auxiliary Atoms in Forks (Extended Abstract)

Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
This work tackles the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context  ...  In this paper, we introduce a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There, in which we deal with a new connective we call fork.  ...  Briefly, tensors extend the matrix (2-way) data to multi-way data.  ... 
doi:10.24963/ijcai.2020/685 dblp:conf/ijcai/Miettinen020 fatcat:ksb2lejf35ggtk3otqjn7xivke

Variational Bayes in Private Settings (VIPS) (Extended Abstract)

James R. Foulds, Mijung Park, Kamalika Chaudhuri, Max Welling
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
In the full paper we extend our method to a broad class of models, including Bayesian logistic regression and sigmoid belief networks.  ...  We overcome this by combining: (1) an improved composition method, called the moments accountant, and (2) the privacy amplification effect of subsampling mini-batches from large-scale data in stochastic  ...  Fusing traditional solvers and learning based methods seems an promising way to bridge complex real world to the highly-abstracted CO problems, and to combine the best of the two areas.  ... 
doi:10.24963/ijcai.2020/694 dblp:conf/ijcai/YanYH20 fatcat:pc4nelo7gzfmvmsiym3ohwspxa

Cross-corpus acoustic emotion recognition: Variances and strategies (Extended abstract)

Bjorn Schuller, Bogdan Vlasenko, Florian Eyben, Martin Wollmer, Andre Stuhlsatz, Andreas Wendemuth, Gerhard Rigoll
2015 2015 International Conference on Affective Computing and Intelligent Interaction (ACII)  
Most studies tend to overestimation in this respect: acted data is often used rather than spontaneous data, results are reported on pre-selected prototypical data, and true speaker disjunctive partitioning  ...  To better cope with the observed high variances, different types of normalization are investigated. 1.8 k individual evaluations in total indicate the crucial performance inferiority of inter-to intracorpus  ...  ACKNOWLEDGMENT The research leading to these results has received funding from the European Community's Seventh  ... 
doi:10.1109/acii.2015.7344612 dblp:conf/acii/SchullerVEWSWR15 fatcat:bavnl7jzfbdaxjke6ea4r4pjoa

Directed Graph Networks for Logical Reasoning (Extended Abstract)

Michael Rawson, Giles Reger
2020 Conference on Automated Deduction  
We further demonstrate the generality of our work in a first-order context with a premise selection task.  ...  Such models have applications for learned functions of logical data, such as in guiding theorem provers.  ...  Augmentation No data augmentation is used as the dataset is relatively large already, and further it is unclear what augmentation would be applied: the "symbolic vocabulary permutation" approach [2]  ... 
dblp:conf/cade/RawsonR20 fatcat:a6ztcjfl6jfcnfumssmych6yy4

Towards a theory of spatial database queries (extended abstract)

Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht
1994 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '94  
A general model for spatial databases is considered, which extends the relational model by a l l o wing as tuple components not only atomic values but also geometrical gures.  ...  The main purpose of the paper is to open up new grounds for theoretical research in the area of spatial database systems. Consequently, m a n y open problems are indicated.  ...  In KKR90] , it was observed that the calculus cannot be extended with declarative iteration based on least xpoints, since such an extension would no longer be closed for the spatial data model.  ... 
doi:10.1145/182591.182640 dblp:conf/pods/ParedaensBG94 fatcat:olbqs4yqrbcgvnrtkhpcsuya24

Symbolic mathematics system evaluators (extended abstract)

Richard J. Fateman
1996 Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC '96  
Here we explain the conflicting requirements, describe some solutions from current systems, and propose alternatives that might be preferable sometimes.  ...  We give examples primarily from Axiom, Macsyma, Maple, Mathematica, with passing mention of a few other systems.  ...  algebra systems based on an algebraic mathematical abstraction that embodied most of what people have been trying to do.  ... 
doi:10.1145/236869.236907 dblp:conf/issac/Fateman96 fatcat:bzwdnup5ifh6jjgzcfpsyffy5y

Combining fuzzy information from multiple systems (extended abstract)

Ronald Fagin
1996 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '96  
The author is also grateful to Eli Upfal for valuable suggestions, and to Laura Haas and Ed Wimmers for detailed comments on a preliminary version of the paper.  ...  Acknowledgements The author is grateful to Laura Haaa and Dragutin Petkovic for suggesting the problem, and for helpful discussions.  ...  It is designed to be capable of integrating data that resides in different database systems as well as a variety of non-database data servers.  ... 
doi:10.1145/237661.237715 dblp:conf/pods/Fagin96 fatcat:3nzztcs7cfb7tfotfetf77xbuq

Experimentation and conjectures in the real Schubert calculus for flag manifolds (extended abstract) [article]

James Ruffo, Yuval Sivan, Evgenia Soprunova, Frank Sottile
2005 arXiv   pre-print
In this extended abstract, we give a refinement of that conjecture for the flag manifold and present massive experimentation (over 12 GigaHertz-Years) that supports our refined conjecture.  ...  We also establish relationships between different cases of the conjecture and describe some new phenomena uncovered in this experimentation.  ...  We do not state it here in the extended abstract. for the problem 13245 4 · 12435 4 = 12 on Fℓ(2, 3; 5) (13245 4 , 12435 4 ) on Fℓ(2 < 3; 5).  ... 
arXiv:math/0502040v1 fatcat:bavw7mbs4jay5me7qovojiulri

Towards a minimal representation of affective gestures (Extended abstract)

Donald Glowinski, Marcello Mortillaro, Klaus Scherer, Nele Dael, Gualtiero Volpe Antonio Camurri
2015 2015 International Conference on Affective Computing and Intelligent Interaction (ACII)  
The GEMEP (Geneva multimodal emotion portrayals) corpus was used to validate this framework. Twelve emotions expressed by ten actors form the selected data set of emotion portrayals.  ...  The main goal is to individuate a minimal representation of emotional displays based on non-verbal gesture features.  ...  In order to determine the number of components to retain, the module can apply to the features two complementary stopping rules [26] : parallel analysis (randomly permutated data, critical value 95 th  ... 
doi:10.1109/acii.2015.7344616 dblp:conf/acii/GlowinskiMSDVC15 fatcat:gsetyz5xpveydm5hbqddh6z5ce

Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract [article]

Alexander Kurz and Tomoyuki Suzuki and Emilio Tuosto
2013 arXiv   pre-print
Inspired by nominal techniques -- as those popular in process calculi -- we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation  ...  formal languages in terms of nominal automata.  ...  After starting the protocol, A waits for a list of services offered by B to select from (for simplicity, data is not represented). Upon request, B replies to A with a list of options to select from.  ... 
arXiv:1310.7093v1 fatcat:rxvn5462grcwtb5tucn4wyixoa

Lightweight Random Indexing for Polylingual Text Classification (Extended Abstract)

Alejandro Moreo Fernández, Andrea Esuli, Fabrizio Sebastiani
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
This scenario is more and more frequent, given the large quantity of multilingual platforms and communities emerging on the Internet.  ...  In this work we analyse some important methods proposed in the literature that are machine-translation-free and dictionary-free, and we propose a particular configuration of the Random Indexing method  ...  For the sake of brevity, in this extended abstract we will restrict our attention to the RCV1/RCV2 experiments, and refer the interested reader to [Moreo Fernández et al., 2016] for more details.  ... 
doi:10.24963/ijcai.2018/801 dblp:conf/ijcai/FernandezE018 fatcat:sesyd366mfcdvfyixojvdvqsiu

Extended Initiality for Typed Abstract Syntax

Benedikt Ahrens, Jan Rutten
2012 Logical Methods in Computer Science  
Thus we obtain an extended initiality theorem for typed abstract syntax, in which translations between terms over different types can be specified via the associated category-theoretic iteration operator  ...  Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of 'models', yielding induction and recursion principles for abstract syntax.  ...  Furthermore, we thank Jan Rutten and the anonymous referees for their helpful comments and advice.  ... 
doi:10.2168/lmcs-8(2:1)2012 fatcat:yplcj2kx2jecxie76cr3gtd7ou

Lost in Abstraction: Monotonicity in Multi-Threaded Programs (Extended Technical Report) [article]

Alexander Kaiser, Daniel Kroening, Thomas Wahl
2014 arXiv   pre-print
In this paper, we show that the act of obtaining finite-data thread abstractions for model checking can be at odds with monotonicity: Predicate-abstracting certain widely used monotone software results  ...  We demonstrate how the abstract programs can be modified into monotone ones, without affecting safety properties of the non-monotone abstraction.  ...  The idea of "making" systems monotone, in order to enable wqo-based reasoning, was pioneered in earlier work [6, 3] .  ... 
arXiv:1406.5715v2 fatcat:necrlavcqvhujblmquutt5x3dq

On-line algorithms for Steiner tree problems (extended abstract)

Piotr Berman, Chris Coulston
1997 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97  
Given a graph with non-negative weights and a set of pairs of vertices find the minimum network of edges such that each pair of vertices is in the same connected component.  ...  The constant factors hidden in the O-notation are small, in the case of the GST, we are within factor 2 from the proven lower bound.  ...  Acknowledgments We would like to thank Martin Furer for introducing us to the Generalized Steiner Tree Problem, and Amos Fiat for proposing the on-line version of the RSA problem.  ... 
doi:10.1145/258533.258618 dblp:conf/stoc/BermanC97 fatcat:jha4nz7znjc3ngbjmhmkerq63a
« Previous Showing results 1 — 15 out of 46,423 results