241 search results - page 9 / 49 » Fast heuristics for large scale covering-location problems |
78
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a max-margin formulation for the multi-label classification problem where the goal is to tag a data point with a set of pre-specified labels. Given a set of L labels, a...
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
WWW
2011
ACM
14 years 4 months ago
2011
ACM
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
101
click to vote
TSC
2008
14 years 9 months ago
2008
Web services are considered to be a potential silver bullet for the envisioned Service Oriented Architecture, in which loosely coupled software components are published, located, a...