2780 search results - page 355 / 556 » Effective features of algorithm visualizations |
122
click to vote
CIKM
2001
Springer
15 years 7 months ago
2001
Springer
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
152
Voted
AI
2008
Springer
15 years 2 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
151
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
135
Voted
3DPVT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
138
Voted
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...