3894 search results - page 499 / 779 » Approximation Algorithms for Biclustering Problems |
154
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
152
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
134
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...
136
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
152
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...