Sciweavers

ESCAPE
2007
Springer
262views Algorithms» more  ESCAPE 2007»
14 years 5 months ago
On the L(h, k)-Labeling of Co-comparability Graphs
Tiziana Calamoneri, Saverio Caminiti, Stephan Olar...
ESCAPE
2007
Springer
251views Algorithms» more  ESCAPE 2007»
14 years 5 months ago
Extending the Hardness of RNA Secondary Structure Comparison
Guillaume Blin, Guillaume Fertin, Irena Rusu, Chri...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
14 years 5 months ago
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
Wolfgang W. Bein, José R. Correa, Xin Han
ECML
2007
Springer
14 years 5 months ago
Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendr...
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
14 years 5 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
COLT
2007
Springer
14 years 5 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
CEAS
2007
Springer
14 years 5 months ago
Email Communities of Interest
Email has become an integral and sometimes overwhelming part of users’ personal and professional lives. In this paper, we measure the flow and frequency of user email toward th...
Lisa Johansen, Michael Rowell, Kevin R. B. Butler,...
CAV
2007
Springer
121views Hardware» more  CAV 2007»
14 years 5 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
CAV
2007
Springer
116views Hardware» more  CAV 2007»
14 years 5 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
ATAL
2007
Springer
14 years 5 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker