Sciweavers

1046 search results - page 14 / 210
» Approximation Algorithms for Domination Search
Sort
View
COMGEO
2004
ACM
13 years 8 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
SODA
1994
ACM
85views Algorithms» more  SODA 1994»
13 years 9 months ago
An Optimal Algorithm for Approximate Nearest Neighbor Searching
Sunil Arya, David M. Mount, Nathan S. Netanyahu, R...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
IJCM
2002
42views more  IJCM 2002»
13 years 8 months ago
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
Panagiotis D. Michailidis, Konstantinos G. Margari...
COCOA
2009
Springer
14 years 11 days ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu