Sciweavers

1067 search results - page 70 / 214
» Probabilistic regular graphs
Sort
View
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 18 days ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
98
Voted
ESOP
2000
Springer
15 years 4 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
101
Voted
JSAT
2006
87views more  JSAT 2006»
15 years 16 days ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
ICPR
2008
IEEE
15 years 7 months ago
Scale invariant face recognition using probabilistic similarity measure
In video surveillance, the size of face images is very small. However, few works have been done to investigate scale invariant face recognition. Our experiments on appearance-base...
Zhifei Wang, Zhenjiang Miao
210
Voted
ASUNAM
2011
IEEE
14 years 17 days ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...