Filters








733,861 Hits in 5.5 sec

Precise concrete type inference for object-oriented languages

John Plevyak, Andrew A. Chien
1994 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications - OOPSLA '94  
We present an incremental constraint-based type inference which produces precise concrete type information for a much larger class of programs at lower cost.  ...  Our algorithm extends the analysis in response to discovered imprecisions, guiding the analysis' effort to where it is most productive.  ...  The inference algorithm creates a type variable for each set of run time variables it wishes to distinguish.  ... 
doi:10.1145/191080.191130 dblp:conf/oopsla/PlevyakC94 fatcat:pfywpeiz4jff3gcdkmwtvikvl4

Precise concrete type inference for object-oriented languages

John Plevyak, Andrew A. Chien
1994 SIGPLAN notices  
We present an incremental constraint-based type inference which produces precise concrete type information for a much larger class of programs at lower cost.  ...  Our algorithm extends the analysis in response to discovered imprecisions, guiding the analysis' effort to where it is most productive.  ...  The inference algorithm creates a type variable for each set of run time variables it wishes to distinguish.  ... 
doi:10.1145/191081.191130 fatcat:wgyx3rw3drfrjij3nrixnwa5ke

An efficient algorithm for AS path inferring

Guoqiang Yang, Wenhua Dou
2009 Proceedings of the 2009 International Conference on Hybrid Information Technology - ICHIT '09  
This paper proposes an efficient algorithm for inferring all pair shortest AS paths in a relationship annotated AS graph.  ...  Recently with more accurate AS relationship inferring algorithm and publicly available AS topology data, it is possible to infer AS paths without accessing the source.  ...  We apply our algorithm on the data set to infer all pair shortest AS paths, and compare them with the AS paths inferred by MAO's algorithm.  ... 
doi:10.1145/1644993.1645020 dblp:conf/ichit/YangD09 fatcat:kbi3ty7vqjb4xfdjqbfxypxbqa

Speeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals [chapter]

Lilyana Mihalkova, Matthew Richardson
2010 Lecture Notes in Computer Science  
This paper presents a meta-inference algorithm that can speed up any of the available inference techniques by first clustering the query literals and then performing full inference for only one representative  ...  Thus, when learning weights for a fixed set of clauses, the clustering step incurs only a one-time up-front cost.  ...  Acknowledgment We would like to thank Tuyen Huynh for helpful discussions regarding the relevance of the restricted scenario and Eyal Amir for pointing out the relationship to Rao-Blackwellised particle  ... 
doi:10.1007/978-3-642-13840-9_11 fatcat:tzdpe7ujgfeqbcilyushkdh7om

Detecting privacy leaks using corpus-based association rules

Richard Chow, Philippe Golle, Jessica Staddon
2008 Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08  
We find inferences in private corpora by using analogues of our Web-mining algorithms, relying on an index for the corpus rather than a Web search engine. We present results from two experiments.  ...  Our model also includes the important case of private corpora, to model inference detection in enterprise settings in which there is a large private document repository.  ...  The authors gratefully acknowledge financial support for this project by Fujitsu Limited, Japan.  ... 
doi:10.1145/1401890.1401997 dblp:conf/kdd/ChowGS08 fatcat:t7rzipw4ofalfdifn4oju476tq

Automated inference of atomic sets for safe concurrent execution

Peter Dinges, Minas Charalambides, Gul Agha
2013 Proceedings of the 11th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering - PASTE '13  
Our implementation of the analysis allowed us to derive the atomic sets for large code bases such as the Java collections framework in a matter of minutes.  ...  Atomic sets relieve the programmer from the burden of recognizing and pruning execution paths which lead to interleaved access, thereby reducing the potential for data races.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1145/2462029.2462030 dblp:conf/paste/DingesCA13 fatcat:6kwowp4ppbentiu4olntixvzsq

Grammar Inference for Web Documents

Shahab Kamali, Frank Wm. Tompa
2011 International Workshop on the Web and Databases  
We also propose an algorithm to infer such grammars, and prove that we can infer an appropriate grammar with high probability from given samples.  ...  These differences make inference of the underlying structure more difficult for presentational XML.  ...  Next, we apply our algorithm to mathematical expressions encoded with Presentation MathML.The first set contains 50 expressions that contain matrices, and the second set contains 50 expressions that contain  ... 
dblp:conf/webdb/KamalT11 fatcat:pm5uj235j5dytdvrtt2qb4a3ke

Targeted test input generation using symbolic-concrete backward execution

Peter Dinges, Gul Agha
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
Our implementation of the analysis allowed us to derive the atomic sets for large code bases such as the Java collections framework in a matter of minutes.  ...  Atomic sets relieve the programmer from the burden of recognizing and pruning execution paths which lead to interleaved access, thereby reducing the potential for data races.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1145/2642937.2642951 dblp:conf/kbse/DingesA14 fatcat:nutrd5u6tfeszof2xjtjmp7oqu

On the complexity of inferring functional dependencies

Heikki Mannila, Kari-Jouko Räihä
1992 Discrete Applied Mathematics  
We show that this problem is solvable by a brute-force algorithm in O(n'2'p log p) time for a relation withp rows and n attributes. We show that for fixed n, time R(p logp) is a lower bound.  ...  The dependency in$rence problem is to find a cover for the set of functional dependencies that hold in a given relation.  ...  Theorem 4 . 4 Any algorithm for dependency inference uses in the worst case at least time S(n -1) for an attribute set of n attributes.  ... 
doi:10.1016/0166-218x(92)90031-5 fatcat:qv5ug6bcqrbplljbsm3xrjupru

Inference in credal networks: branch-and-bound methods and the A/R+ algorithm

José Carlos Ferreira da Rocha, Fabio Gagliardi Cozman
2005 International Journal of Approximate Reasoning  
A credal network is a graphical representation for a set of joint probability distributions. In this paper we discuss algorithms for exact and approximate inferences in credal networks.  ...  We propose a branch-and-bound framework for inference, and focus on inferences for polytreeshaped networks.  ...  consequently contain the exact set-valued messages.  ... 
doi:10.1016/j.ijar.2004.10.009 fatcat:xeulvzqdtbdk3i6rwsnl23fqxe

Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitative Probabilistic Assesments [article]

Fabio Gagliardi Cozman, Cassio Polpo de Campos, Jaime Ide, Jose Carlos Ferreira da Rocha
2012 arXiv   pre-print
New exact and approximate inference algorithms based on multilinear programming and iterated/loopy propagation of interval probabilities are presented; their superior performance, compared to existing  ...  Each run of the LPE+2U algorithm contains the exact interval, because the LPE algorithm processes all vertices of credal sets in the network; the intersection of all approximate intervals contains the  ...  Our new algorithms rely on the 2U algorithm -the first poly-nomial inference method for Boolean polytrees [18] .  ... 
arXiv:1207.4121v1 fatcat:jw2kwnvjirbrpduat6tmstmxm4

Link Loss Inference Algorithm with Network Topology Aware in Communication Networks

Shunli Zhang
2020 Mathematical Problems in Engineering  
In order to overcome these shortcomings, this paper proposes a link loss inference algorithm with network topology aware.  ...  Through simulation experiments, it is verified that the proposed algorithm has achieved better results in terms of congestion link determination and link loss rate estimation accuracy.  ...  [19] proposed an inference algorithm for link loss rate. is algorithm divides the graph composed of links into multiple family sets from the bottom up according to the association relationship of the  ... 
doi:10.1155/2020/5836248 fatcat:gr3bp4chzbalxaj5jt4jkyxp64

Adding overloading to Java type inference

Andreas Stadelmeier, Martin Plümicke
2015 Software Engineering  
We present the change of the data-structures and the algorithm.  ...  In this paper we extend our Java with type inference by adding methods.  ...  The type inference algorithm is able to infer all possible types for a missing type declaration in the source code.  ... 
dblp:conf/se/StadelmeierP15 fatcat:va7hllxn2fhr5dgexv3msjtoxa

Set containment inference and syllogisms

Paolo Atzeni, D.Stott Parker
1986 Theoretical Computer Science  
Necessary and sufficient conditions for consistency, as well as sound and complete sets of inference rules, are presented for binary containment.  ...  The sets of inference rules are compact, and lead to polynomial-time inference algorithms, so permitting negative constraints does not result in intractability for this problem. * Currently at Universitti  ...  Algorithms for the solution of the inference problem (called inference algorithms) have correctness proofs that are usually based on sound and complete sets of inference rules. Definition.  ... 
doi:10.1016/0304-3975(86)90011-3 fatcat:hwa6iwz655en7ckwlgbawdmpbq

Gaussian Mixture Reduction for Time-Constrained Approximate Inference in Hybrid Bayesian Networks

Cheol Young Park, Kathryn Blackmond Laskey, Paulo C. G. Costa, Shou Matsumoto
2019 Applied Sciences  
The trade-off algorithm performs pre-processing to find optimal run-time settings for the extended algorithm.  ...  Experimental results for four CG networks compare performance of the extended algorithm with existing algorithms and show the optimal settings for these CG networks.  ...  Chang for the initial research regarding HMP-GMR. Conflicts of Interest: The authors declare no conflict of interest. Appl. Sci. 2019, 9, 2055  ... 
doi:10.3390/app9102055 fatcat:c3vocssyxvb6nerw3itdbc624m
« Previous Showing results 1 — 15 out of 733,861 results