A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Approximate inference using conditional entropy decompositions
2007
Journal of machine learning research
Preserved Fulltext
We introduce a novel method for estimating the partition function and marginals of distributions defined using graphical models. ...
The structure of the bound is determined by a permutation, or elimination order, of the model variables. ...
We also experimented with other elimination distributions but these yielded inferior results. method with the clusters and elimination orders defined above. ...
dblp:journals/jmlr/GlobersonJ07
fatcat:bc5jg23e7rbepasrttjqyva4be
Anytime anyspace probabilistic inference
2005
International Journal of Approximate Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper investigates methods that balance time and space constraints against the quality of Bayesian network inferences--we explore the three-dimensional spectrum of "time · space · quality" trade-offs ...
The algorithm seeks a balanced synthesis of probabilistic techniques for bounded systems. ...
We thank two reviewers who gave important suggestions, and the editor, who oversaw this long process with great patience--particularly when waiting for us to produce the final version. ...
doi:10.1016/j.ijar.2004.04.001
fatcat:lrvtscaumvbuhny56scwycpn4e
Anytime anyspace probabilistic inference
2004
International Journal of Approximate Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper investigates methods that balance time and space constraints against the quality of Bayesian network inferences--we explore the three-dimensional spectrum of "time · space · quality" trade-offs ...
The algorithm seeks a balanced synthesis of probabilistic techniques for bounded systems. ...
We thank two reviewers who gave important suggestions, and the editor, who oversaw this long process with great patience--particularly when waiting for us to produce the final version. ...
doi:10.1016/s0888-613x(04)00047-7
fatcat:yu4uqhddarcodfum3knugvam3i
Distributed Tree Decomposition with Privacy
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Tree Decomposition of Graphical Models is a well known method for mapping a graph into a tree, that is commonly used to speed up solving many problems. ...
In this context, we propose a new distributed method, based on token passing and local elections, that shows performances (in the jointree quality) close to the state of the art Bucket Elimination in a ...
Distributed, Depth-First, Tree Decomposition In distributed constraints optimization, Distributed DFS (DDFS) is the state of the art [19, 8] . ...
doi:10.1007/978-3-642-33558-7_10
fatcat:bxq5denjdfg65nbybxmz4h46jm
Learning Bounded Tree-width Bayesian Networks using Integer Linear Programming
2014
International Conference on Artificial Intelligence and Statistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our tests clearly indicate that our approach works in practice, as our implementation was able to find an optimal or nearly optimal network for most of the data sets. ...
A key component of our program is a novel integer linear formulation for bounding tree-width of a graph. ...
Most of the work was done while Hossein Shahrabi Farahani was affiliated with School of Computer Science and Communication and Science for Life Laboratory at Royal Institute of Technology. ...
dblp:conf/aistats/ParviainenFL14
fatcat:4e3kqjnnlbddxanroxzmrvg6p4
AN ASSESSMENT OF A METRIC SPACE DATABASE INDEX TO SUPPORT SEQUENCE HOMOLOGY
2005
International journal on artificial intelligence tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
M-tree is one such data structure specialized for the management of large data sets on disk. We explore the application of M-trees to the storage and retrieval of peptide sequence data. ...
Consequently, it is often anticipated that hierarchical clustering can be leveraged as a basis for scalable database index structures capable of managing the hyper-exponential growth of sequence data. ...
In bi-directional initialization, farthest-first traversal algorithm, which gives a solution guaranteed to be within a factor of 2 of optimal, is used to cluster a single level or data with global consideration ...
doi:10.1142/s0218213005002430
fatcat:wptrzbk6wvbajkm2jcdqdyuqtm
Optimal distributed frequency planning for OFDMA femtocell networks
2013
2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
and that the proposed algorithm is suitable for implementation in a distributed 4G femtocell network regarding signaling overhead and latency aspects. ...
Femtocell networks have gained momentum due to their important benefits, such as improved indoor coverage, higher areal spectral efficiency, enhanced signal quality, among others. ...
Rodrigues would like to thank CAPES (Brazil) for a Ph.D. Scholarship support, and also CNPq (Brazil) and FUNCAP (Ceará, Brazil) for a Postdoctoral Scholarship support. ...
doi:10.1109/pimrc.2013.6666645
dblp:conf/pimrc/RodriguesC13
fatcat:fazj5mmngzbdrhffvi3razfs4y
Optimal Rate Allocation in Cluster-Tree WSNs
2011
Sensors
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper, we propose a solution to the problem of guaranteed time slot allocation in cluster-tree WSNs. ...
This is possible because the CDM finds the optimal solution with a small number of iterations. ...
Note that in cluster-tree topologies, the subset of nodes associated with the i-th constraint is always a subset of the nodes related to the constraint immediately above c i . ...
doi:10.3390/s110403611
pmid:22163812
pmcid:PMC3231305
fatcat:q7tyxknrnjg4dcw6bugioyeglm
Bounded approximate decentralised coordination via the max-sum algorithm
2011
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It builds a tree structure by eliminating dependencies between the functions and variables within the factor graph that have the least impact on solution quality. ...
It then uses the max-sum algorithm to optimally solve the resulting tree structured constraint network, and provides a bounded approximation specific to the particular problem instance. ...
Learning Agents for Decentralised Data and Information Systems) project; a BAE Systems and EPSRC (Engineering and Physical Research Council) strategic partnership (EP/C548051/1). ...
doi:10.1016/j.artint.2010.11.001
fatcat:bm22xdusjngs7odno4z6uft4q4
Lifted Tree-Reweighted Variational Inference
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The second is a method for tightening the relaxation of the marginal polytope using lifted cycle inequalities and novel exchangeable cluster consistency constraints. ...
The first is a method for efficiently computing maximum spanning trees in highly symmetric graphs, which can be used to optimize the TRW edge appearance probabilities. ...
We re-emphasize that the complexity of variational inference with lifted exchangeable constraints is guaranteed to be polynomial in the domain size, unlike exact methods based on lifted counting elimination ...
arXiv:1406.4200v2
fatcat:xblvvdewvnbe5ahg64a4ako5pe
Application Layer Multicast Technology of Streaming Media
2011
Journal of Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
With the rapid development of network technology, Internet business has been transferred from a simple text into a host text, audio, video and other streaming services. ...
Application layer multicast is one of the key technologies to protect the large-scale service quality of streaming media system, which has become an important part of study. ...
End hosts self-organization algorithm for establishing and maintaining overlay networks. (6) Multicast tree construction and optimization Multicast tree construction can improve the quality of the end ...
doi:10.4304/jnw.6.8.1122-1128
fatcat:yygcuylfjzdp7i6zuotmpr3lae
Multi-level submap based SLAM using nested dissection
2010
2010 IEEE/RSJ International Conference on Intelligent Robots and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
along the corresponding cluster tree. ...
Abstract-We propose a novel batch algorithm for SLAM problems that distributes the workload in a hierarchical way. ...
Although both schemes generate elimination orderings with comparable qualities, nested dissection tends to perform better on large graphs, and its elimination trees are typically lower and better balanced ...
doi:10.1109/iros.2010.5650197
dblp:conf/iros/NiD10
fatcat:7xaeeqkfifeajb46afrponyzpa
View Selection under Multiple Resource Constraints in a Distributed Context
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Then, we propose a solution using constraint programming for modeling and solving the view selection problem under multiple resource constraints in a distributed context. ...
In this paper, we address the view selection problem in a distributed scenario. We rst extend the AND-OR view graph to capture the distributed features. ...
The design of these heuristics will also guarantee the optimality of the solution where no time limit is imposed. Fig. 1 : 1 Search tree using constraint propagation. ...
doi:10.1007/978-3-642-32597-7_25
fatcat:77p6xjdn4fdetm2tiyjz4fuubm
Generic factor-based node marginalization and edge sparsification for pose-graph SLAM
2013
2013 IEEE International Conference on Robotics and Automation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
a Chow-Liu tree. ...
The proposed algorithm improves upon existing methods in two key ways: First, it is not limited to strictly full-state relative-pose constraints and works equally well with other low-rank constraints such ...
best approximate the true distribution over the elimination clique using a Chow-Liu tree (in the case of sparsified node removal). ...
doi:10.1109/icra.2013.6631403
dblp:conf/icra/Carlevaris-BiancoE13
fatcat:64dl63pomjbijdy7yyb7cb6ene
Generating subtour elimination constraints for the TSP from pure integer solutions
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We stick to a very simple ILP-model and relax the subtour elimination constraints only. ...
The method of choice for solving the TSP to optimality is a branch and cut approach. ...
We would like to thank the developers of the SCIP MIP-solver from the Konrad-Zuse-Zentrum für Informationstechnik Berlin, especially Mr Gerald Gamrath, for their valuable support. ...
arXiv:1511.03533v2
fatcat:hlok35oj5zgnrpuzsby4i5fje4
« Previous
Showing results 1 — 15 out of 25,347 results