3894 search results - page 423 / 779 » Approximation Algorithms for Biclustering Problems |
143
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
166
click to vote
WINE
2007
Springer
15 years 11 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
151
click to vote
NIPS
2007
15 years 6 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
243
click to vote
COCO
2011
Springer
14 years 4 months ago
2011
Springer
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
236
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...