Proceedings

The electronic proceedings for ISAIM 2010 will be available online (see below) no later than around the middle of January (it was December but quite a few papers have not yet been received). A zip file containing all papers will also be available at that time from this ZIP file link. To make use of the ZIP file you should do the following:

1. Download the ZIP file.
2. Unzip the downloaded file.
3. Open the file PROCEEDINGS/index.html in a web browser.
4. Select the "Proceedings" link in the left hand navigation bar, and you should see a page containing links to all the papers in the proceedings.

Note that papers accepted at ISAIM 2010 are not published in formal proceedings and not subject to copyright restrictions. All authors retain the copyright to their papers.

List of Papers

Below, we provide the on-line proceedings for ISAIM 2010. The proceedings include links to papers accepted to the main technical program, papers by the Keynote Speakers, and papers by the invited speakers of the Special Sessions.

Papers accepted to the main technical program (partial list - more to follow)

• On aggregating binary relations using 0-1 integer linear programming
  Julien Ah-Pine, Xerox Research Centre Europe, Meylan, France

• Extracting independent rules: a new perpsective of boosting
  Yuchen Zhang, Li Zhang, Tsinghua University, Beijing

• Computational complexity and approximization methods of most relevant explanation
  Heejin Lim, Changhe Yuan, Mississippi State University

• On the locality of action domination in sequential decision making
  Emmanuel Rachelson, Michail G. Lagoudakis, Technical University of Crete

• Valid parameters for predictive state representations
  Britton Wolfe, Indiana University-Purdue University, Fort Wayne

• On analysis of unicity of Jeffrey's rule of conditioning in a probabilistic framework
  Salem Benferhat, Karem Tabia, Karima Sedki, Université d'Artois

• An analysis of breadth-first beam search using uniform cost trees
  Sandip Aine, P.P. Chakrabarti, Indian Institute of Technology, Kharagpur

• Solving influence diagrams using heuristic search
  Changhe Yuan, Xiaojian Wu, Mississippi State University

• Evaluating partition strategies for mini-bucket elimination
  Emma Rollon, Rina Dechter, University of California, Irvine

• Toward parallel search for optimization in graphical models
  Lars Otten, Rina Dechter, University of California, Irvine

• Multi-armed bandits with episode context
  Christopher D. Rosin, Parity Computing, Inc.

• On the convergence of the convex relaxation method and distributed optimization of Bethe free energy
  Ming Su, University of Washington, Seattle

• Sparse Markov net learning with priors on regularization parameters
  Katya Scheinberg, Columbia University, Irina Rish, IBM T.J. Watson Research Center, Narges Bani Asadi, Stanford University

• Design of parallel portfolios for SAT-based solving of Hamiltonian cycle problems
  Miroslav N. Velev, Ping Gao, Aries Design Automation, L.L.C.

• Similarity measures in formal concept analysis
  Faris Alqadah, Raj Bhatnagar, University of Cincinnati

• Approximate solutions of interactive dynamic influence diagrams using ε-behavioral equivalence
  Muthukumaran C., Prashant Doshi, University of Georgia, and Yifeng Zeng, Aalborg University.

Papers of the Keynote Speakers

• Using mathematics on an industrial scale
  Warren Hunt Jr., University of Texas, Austin

• Datalog±: A Unified Approach to Ontologies and Integrity Constraints
  Georg Gottlob, St. Anne's College, Oxford, UK

• Windows on the Mind: Some recent aspects of modeling and pattern recognition of cognition
  Larry Manevitz, University of Haifa, Israel

Papers of the Special Session on Constraint Programming and Hybrid Methods

• Checking Up on Branch-and-Check
  J. Christopher Beck, University of Toronto

• Linearization of Global Constraints
  Meinolf Sellmann, Brown University

• A Polyhedral Study of the Alldifferent System
  Dimitris Magos, Technological Educational Institute of Athens

• A Polyhedral Study of the Cumulative Constraint
  Tallys Yunes, University of Miami

Papers of the Special Sessions on Boolean and Pseudo-Boolean Functions

• Exploiting regularity in learning
  Martin Anthony

• Coverable functions: definitions and properties
  Ondrej Cepek

• Coverable functions: hardness results
  Petr Kucera

• Learning random DNF over the uniform distribution
  Linda Sellie

• Ubiquitous monotone and almost-monotone Boolean functions in systems biology
  Utz-Uwe Haus

• Solving scheduling problems with Binary Decision Diagrams
  John N. Hooker

• Complexity results of linear XSAT problems
  Stefan Porschen

• On evolvability: the swapping algorithm, product distributions, and covariance
  Dimitris Diochnos

• Cones of non-negative quadratic pseudo-Boolean functions
  Endre Boros

• Black-box methods for constrained quadratic 0-1 optimization
  F. Liers

• A geometric bridge from convex polytopes to threshold logic
  M. Reza Emamy-K.

• A combinatorial algorithm for the threshold recognition problem
  Jan-Georg Smaus

Papers of the Special Session on Data Clustering for Bio-Informatics

• Prior Information Based Bayesian Infinite Mixture Model
  Zhen Hu, Siva Sivaganesan, and Mario Medvedovic

• Simultaneous Search in Multiple Lattices for Knowledge Discovery
  Mrunal Deshmukh, Raj Bhatnagar, and Anil Jegga

• Identifying Transcriptional Modules using Subspace Clustering
  Amit Sinha

• Model Quality Assessment in Membrane Proteins Using predicted Lipid Accessibility Profiles
  Mukta Phatak and Jaroslaw Meller