Sciweavers

5595 search results - page 754 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ECCV
2008
Springer
16 years 8 months ago
GeoS: Geodesic Image Segmentation
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 ...
Antonio Criminisi, Toby Sharp, Andrew Blake
ICML
2007
IEEE
16 years 7 months ago
Simpler core vector machines with enclosing balls
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...
András Kocsor, Ivor W. Tsang, James T. Kwok
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 7 months ago
Optimal static range reporting in one dimension
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...
Stephen Alstrup, Gerth Stølting Brodal, The...
INFOCOM
2009
IEEE
16 years 1 months ago
Downlink MIMO with Frequency-Domain Packet Scheduling for 3GPP LTE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
Suk-Bok Lee, Sayantan Choudhury, Ahmad Khoshnevis,...
IPPS
2009
IEEE
16 years 1 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...