1272 search results - page 118 / 255 » The Set Cover with Pairs Problem |
111
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
91
Voted
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the differ...
109
Voted
WADS
1997
Springer
15 years 4 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
85
Voted
APAL
2010
15 years 26 days ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
122
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
We introduce an online learning approach for multitarget tracking. Detection responses are gradually associated into tracklets in multiple levels to produce final tracks. Unlike ...