STOC
2007
ACM
15 years 22 days ago
2007
ACM
PODS
2009
ACM
15 years 29 days ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
STOC
2009
ACM
15 years 1 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
STOC
2009
ACM
15 years 1 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
WWW
2008
ACM
15 years 1 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
GIS
2006
ACM
15 years 1 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
106
click to vote
GIS
2004
ACM
15 years 1 months ago
2004
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
113
click to vote
ICDE
2008
IEEE
15 years 1 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...