Sciweavers

2531 search results - page 70 / 507
» Group testing in graphs
Sort
View
ICDM
2006
IEEE
107views Data Mining» more  ICDM 2006»
14 years 4 months ago
Improving Grouped-Entity Resolution Using Quasi-Cliques
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
Byung-Won On, Ergin Elmacioglu, Dongwon Lee, Jaewo...
ICCV
2005
IEEE
14 years 4 months ago
An Integrated Framework for Image Segmentation and Perceptual Grouping
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
Zhuowen Tu
ECOOP
1998
Springer
14 years 3 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones
CVPR
2010
IEEE
14 years 4 months ago
Neuron Geometry Extraction by Perceptual Grouping in ssTEM images
In the field of neuroanatomy, automatic segmentation of electron microscopy images is becoming one of the main limiting factors in getting new insights into the functional struct...
Verena Kaynig, Thomas Fuchs, Joachim Buhmann
FSTTCS
2003
Springer
14 years 4 months ago
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
Anupam Gupta, Aravind Srinivasan