1012 search results - page 60 / 203 » Segment intersection searching problems in general settings |
142
click to vote
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
In this work, we propose novel results for the optimization of divergences within the framework of region-based active contours. We focus on parametric statistical models where th...
152
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
163
click to vote
MMB
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
184
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
144
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...