1161 search results - page 213 / 233 » Approximation schemes for clustering problems |
150
click to vote
SDM
2012
SIAM
13 years 4 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
118
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
134
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
144
Voted
ECCV
2008
Springer
16 years 6 days ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
123
Voted
MOBISYS
2006
ACM
16 years 1 months ago
2006
ACM
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...