Sciweavers

166 search results - page 6 / 34
» Partitioning Graphs to Speed Up Dijkstra's Algorithm
Sort
View
ICIP
2008
IEEE
14 years 1 months ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...
IJCAI
2007
13 years 8 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
ICCS
2005
Springer
14 years 13 days ago
A Multi-level Approach for Document Clustering
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
Suely Oliveira, Sang-Cheol Seok
CIVR
2007
Springer
185views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Z-grid-based probabilistic retrieval for scaling up content-based copy detection
Scalability is the key issue in making content-based copy detection (CBCD) methods practical for very large image and video databases. Since copies are transformed versions of ori...
Sébastien Poullot, Olivier Buisson, Michel ...
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 1 months ago
Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS
Markov Logic Networks (MLNs) have emerged as a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including...
Feng Niu, Christopher Ré, AnHai Doan, Jude ...