3894 search results - page 461 / 779 » Approximation Algorithms for Biclustering Problems |
142
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
134
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
153
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
140
Voted
ACISP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...