Sciweavers

1012 search results - page 75 / 203
» Segment intersection searching problems in general settings
Sort
View
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 28 days ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
FOCS
2009
IEEE
15 years 3 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICPR
2008
IEEE
15 years 6 months ago
A robust front page detection algorithm for large periodical collections
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...
MICCAI
1999
Springer
15 years 4 months ago
A New Approach to 3D Sulcal Ribbon Finding from MR Images
Abstract. Sulcal medial surfaces are 3D thin convoluted ribbons embedded in cortical sulci, and they provide distinctive anatomical features of the brain. Here we propose a new app...
Xiaolan Zeng, Lawrence H. Staib, Robert T. Schultz...
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
14 years 12 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld