Sciweavers

260 search results - page 10 / 52
» Quality guarantees for region optimal DCOP algorithms
Sort
View
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 7 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
CCGRID
2003
IEEE
14 years 18 days ago
Creating Services with Hard Guarantees from Cycle-Harvesting Systems
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
Chris Kenyon, Giorgos Cheliotis
CVPR
2012
IEEE
11 years 9 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
CVPR
2011
IEEE
13 years 3 months ago
From Region Similarity to Category Discovery
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...
Carolina Galleguillos, Brian McFee, Serge Belongie...
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
14 years 1 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner