17329 search results - page 2943 / 3466 » Improved non-approximability results |
175
click to vote
DKE
2008
15 years 7 months ago
2008
Traditional methods of association rule mining consider the appearance of an item in a transaction, whether or not it is purchased, as a binary variable. However, customers may pu...
113
click to vote
EOR
2010
15 years 7 months ago
2010
This paper presents a new way of measuring residual income, originally introduced by Magni (2000a,b,c, 2001a,b, 2003). Contrary to the standard residual income, the capital charge...
172
click to vote
DM
2008
15 years 7 months ago
2008
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
158
click to vote
DM
2008
15 years 7 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
225
click to vote
DSP
2008
15 years 7 months ago
2008
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...