3894 search results - page 421 / 779 » Approximation Algorithms for Biclustering Problems |
165
click to vote
SIGMOD
2012
ACM
13 years 7 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
132
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
125
click to vote
ICCSA
2005
Springer
15 years 10 months ago
2005
Springer
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
134
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
127
click to vote
ACSAC
2001
IEEE
15 years 8 months ago
2001
IEEE
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...