1358 search results - page 82 / 272 » Proceedings |
134
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
158
Voted
EDBT
2012
ACM
13 years 5 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
150
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We propose an approach to overcome the two main challenges
of 3D multiview object detection and localization:
The variation of object features due to changes in the viewpoint
an...
119
click to vote
CVPR
1999
IEEE
16 years 4 months ago
1999
IEEE
We treat the problem of edge detection as one of statistical inference. Local edge cues, implemented by filters, provide information about the likely positions of edges which can ...
116
Voted
CVPR
1999
IEEE
16 years 4 months ago
1999
IEEE
We analyze the problem of detecting a road target in background clutter and investigate the amount of prior (i.e. target specific) knowledge needed to perform this search task. Th...