5595 search results - page 1113 / 1119 » Approximation Algorithms for Clustering Problems |
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
100
click to vote
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
SIGGRAPH
1993
ACM
15 years 1 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
104
Voted
AMFG
2007
IEEE
15 years 1 months ago
2007
IEEE
A key problem for "face in the crowd" recognition from existing surveillance cameras in public spaces (such as mass transit centres) is the issue of pose mismatches betwe...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...