642 Hits in 3.9 sec

Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems [chapter]

Igor Razgon, Barry O'Sullivan
Lecture Notes in Computer Science  
In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to being acyclic.  ...  Solving real-world Constraint Satisfaction Problems (CSPs) can prove difficult for a number of applications, such as scheduling [17] , frequency assignment problems [13], multi-commodity flow congestion  ...  Our main result is that the proposed method obliviously recognizes (without spending any computational effort to do the recognition) when the meta-constraint graph of the problem becomes acyclic and, if  ... 
doi:10.1007/978-3-540-73817-6_10 dblp:conf/csclp/RazgonO06 fatcat:k6ysunewprfjzheiary4dtxfli

Tractable Structures for Constraint Satisfaction Problems [chapter]

Rina Dechter
2006 Foundations of Artificial Intelligence  
problem into a tree of constraints which can be solved efficiently.  ...  Example 2 Considering again the graphs in An acyclic constraint network can be solved efficiently.  ... 
doi:10.1016/s1574-6526(06)80011-8 fatcat:xgdvlfau6ranlnalqg6rxjxip4

Hypertree Decompositions: A Survey [chapter]

Georg Gottlob, Nicola Leone, Francesco Scarcello
2001 Lecture Notes in Computer Science  
We also review a number of complexity results on problems whose structure is described by acyclic or nearly acyclic hypergraphs.  ...  A hypertree decomposition of a hypergraph (similar to a tree decomposition of a graph) is a suitable clustering of its hyperedges yielding a tree or a forest.  ...  Z; (D) the marshals capture the robber in W Fig. 7 . 7 Constraint tractability hierarchy 2 (The Constraint Satisfaction Problem CSP.).  ... 
doi:10.1007/3-540-44683-4_5 fatcat:e2x57x7rdbesflhlesjfs6426e

Page 7062 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
We develop efficient algorithms for the recognition of simply foldable 1-D crease patterns and for the reconstruction of a sequence of simple folds.  ...  [Rossi, Gianluca] (I-FRNZ-I; Florence) On the Hamming distance of constraint satisfaction problems. (English summary) Complexity and logic (Vienna, 1998). Theoret. Comput.  ... 

Discriminative Learning of Max-Sum Classifiers

Vojtech Franc, Bogdan Savchynskyy
2008 Journal of machine learning research  
fulfill some additional constraints.  ...  Learning parameters of the max-sum classifier is a challenging problem because even computing the response of such classifier is NP-complete in general.  ...  The main part of this work has been done while the first author was with the Center for Machine Perception.  ... 
dblp:journals/jmlr/FrancS08 fatcat:4jfmubnjbbgardlce6cvlv6g6q

Incremental Inference on Higher-Order Probabilistic Graphical Models Applied to Constraint Satisfaction Problems [article]

Simon Streicher
2022 arXiv   pre-print
The third is a PGMs formulation for constraint satisfaction problems and an algorithm called purge-and-merge to solve such problems too complex for traditional PGMs.  ...  The second is an application of cluster graphs to a practical problem in cartography: land cover classification boosting.  ...  | Constraint satisfaction A constraint satisfaction problem (CSP) involves a set of variables, a domain over each variable, and a set of constraints over these variables.  ... 
arXiv:2202.12916v2 fatcat:znqerksuzrcbzbtu7koxx5gddi

Longest common subsequence as private search

Mark Gondree, Payman Mohassel
2009 Proceedings of the 8th ACM workshop on Privacy in the electronic society - WPES '09  
We then put forth and investigate several privacy structures for the LCS problem and design new and efficient output sampling and equivalence protecting algorithms that provably meet the corresponding  ...  In this paper, we consider the longest common subsequence (LCS) problem as a private search problem, where the task is to find a string of (or embedding corresponding to) an LCS.  ...  There is a growing body of literature -securely solving distributed constraint satisfaction problems [33, 36, 37, 45] , combinatorial auction optimization [40, 44] , selecting a stable bipartite matching  ... 
doi:10.1145/1655188.1655200 dblp:conf/wpes/GondreeM09 fatcat:eqwxwpuhjrepzkykvzut5vo4rm


Enrico Gobbetti, Jean-Francis Balaguer, Daniel Thalmann
1993 Proceedings of the 6th annual ACM symposium on User interface software and technology - UIST '93  
Daemons are used to sequence between system states in reaction to changes in variable values The constraint network is efficiently maintained by an incremental constraint solver based on an enhancement  ...  Adaptive pattern recognition is used to increase input device expressiveness by enhancing sensor data with classification information.  ...  an early version of VB2.  ... 
doi:10.1145/168642.168659 dblp:conf/uist/GobbettiBT93 fatcat:wqp722yumnerzcfvgksi2emzci

MARS: Multi-stage Attack Recognition System

Faeiz Alserhani, Monis Akhlaq, Irfan U. Awan, Andrea J. Cullen, Pravin Mirchandani
2010 2010 24th IEEE International Conference on Advanced Information Networking and Applications  
Moreover, detection of novel and multi-stage attacks are not efficiently achieved by the current systems. Hence, highlevel view of the attacker's behaviour has become a stressing demand.  ...  As a result, enormous data with less efficiency is produced that overwhelms the network administrator.  ...  Definition. 2 A hyper-alert instance 2-Satisfaction of Vul(h) constraints. 3-Conseq(h1).End_time , ExConseq(h1).End_time >=Prereq(h2).start_time The partial matching mechanism has been used to avoid  ... 
doi:10.1109/aina.2010.57 dblp:conf/aina/AlserhaniAACM10 fatcat:bn4ktakv5jflzcvxzz552oiqcy

Evaluation of Multimedia Applications in a Cluster-Oriented Environment

Paweł Czarnul, Tomasz Dziubich, Henryk Krawczyk
2012 Metrology and Measurement Systems  
Next, metrics for subsequent measurements of efficiency, dependability and usability of distributed applications are presented.  ...  As examples, we describe a pair of multimedia applications which we have developed in our department and executed in a cluster-based environment.  ...  The most important problems of computer-aided diagnosis include: reducing the time of diagnosis, expanding the range of algorithms for medical recommendations and increasing the efficiency of endoscopic  ... 
doi:10.2478/v10178-012-0016-9 fatcat:6wnz62h2pjdmpokikzaclsbhp4

Parallel Tree Search in Volunteer Computing: a Case Study

Wenjie Fang, Uwe Beckert
2017 Journal of Grid Computing  
, many problems it solves are intrinsically highly parallel.  ...  While volunteer computing, as a restricted model of parallel computing, has proved itself to be a successful paradigm of scientific computing with excellent benefit on cost efficiency and public outreach  ...  Acknowledgements Open access funding provided by Graz University of Technology. The first author was partially supported by IRIF (previously LIAFA) of Université Paris Diderot.  ... 
doi:10.1007/s10723-017-9411-5 fatcat:5ywy7pyrcng6zhk4kjnhks62zq


2004 International journal of pattern recognition and artificial intelligence  
The second taxonomy considers the types of common applications of graph-based techniques in the Pattern Recognition and Machine Vision field.  ...  Far from providing a definite answer to that question, in this paper we will try to characterize the role that graphs play within the Pattern Recognition field.  ...  One of the most recent tree search methods for isomorphism has been proposed by Larrosa and Valiente 86 in 2002; the authors reformulate graph isomorphism as a Constraint Satisfaction Problem (CSP), a  ... 
doi:10.1142/s0218001404003228 fatcat:ntikshcxqvb4pcp64aonyvmije

Backdoors to Satisfaction [article]

Serge Gaspers, Stefan Szeider
2011 arXiv   pre-print
In this survey we review parameterized complexity results for problems that arise in the context of backdoor sets, such as the problem of finding a backdoor set of size at most k, parameterized by k.  ...  We also discuss recent results on backdoor sets for problems that are beyond NP.  ...  Acknowledgment We thank Ryan Williams for his comments on an earlier version of this survey.  ... 
arXiv:1110.6387v2 fatcat:4k2qifbdyvd6hi5qvhlp6w2uaq

Research on Application of Machine Learning in Data Mining

Xiuyi Teng, Yuxia Gong
2018 IOP Conference Series: Materials Science and Engineering  
Multi-relational learning Problems and research lines investigated at the Machine Learning group in Bari related to learning with complex representations ultimately based on logic languages are briefly  ...  With the increasing amount of information in electronic form the fields of Machine Learning and Data Mining continue to grow by providing new advances in theory, applications and systems.  ...  problems achieving advantages both in efficiency and accuracy.  ... 
doi:10.1088/1757-899x/392/6/062202 fatcat:mb23afk555eyxkv2gqr7kpkqum

Fast and Parallel Decomposition of Constraint Satisfaction Problems

Georg Gottlob, Cem Okulmus, Reinhard Pichler
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful decomposition methods have been developed to overcome this complexity.  ...  ., minimal-width) GHDs for a significantly wider range of CSP instances on modern machines.  ...  Gottlob is, moreover, grateful to Cristina Zoltan for having suggested Go as an appropriate language for the parallelisation of computing hypertree decompositions.  ... 
doi:10.24963/ijcai.2020/161 dblp:conf/ijcai/GottlobOP20 fatcat:y5b43vzoe5gepcufzwehg2o5fy
« Previous Showing results 1 — 15 out of 642 results