31 search results - page 1 / 7 » An Efficient Algorithm for Solving Pseudo Clique Enumeration... |
ALGORITHMICA
2010
13 years 4 months ago
2010
NETWORKS
2008
13 years 4 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
CVPR
1998
IEEE
14 years 6 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
CIKM
1998
Springer
13 years 9 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...