1964 search results - page 345 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
133
click to vote
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
135
Voted
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
124
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
103
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
125
click to vote
CCO
2001
Springer
15 years 6 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...