Sciweavers

2698 search results - page 407 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
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
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...
JCO
1998
102views more  JCO 1998»
15 years 6 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
16 years 28 days ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu