Sciweavers

433 search results - page 55 / 87
» A greedy approximation algorithm for the group Steiner probl...
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
12 years 11 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 8 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
ICCV
2005
IEEE
14 years 2 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
WWW
2011
ACM
13 years 3 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 3 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....