2485 search results - page 109 / 497 » Time Bounded Frequency Computations |
160
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
175
Voted
DKE
2007
15 years 4 months ago
2007
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
145
click to vote
ACTA
2007
15 years 5 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
157
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
134
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...