87 search results - page 16 / 18 » A Faster Algorithm for Minimum Cycle Basis of Graphs |
FIMI
2003
13 years 9 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
JCO
1998
13 years 7 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
MM
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a novel approach to object recognition involving a sparse 2D model and matching using video. The model is generated on the basis of geometry and image measurab...
IJAC
2007
13 years 7 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...