3715 search results - page 79 / 743 » A Space Optimization for FP-Growth |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
- Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works hav...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...