Sciweavers

835 search results - page 133 / 167
» Geometric Logic in Computer Science
Sort
View

Publication
270views
12 years 8 months ago
A Data Hiding Scheme Based on LBPROT Pattern
Texture classification is mainly used for segmentation of texture regions and content-based access to image databases. Lately these texture classification patterns have been appl...
E. E. Varsaki, V. Fotopoulos, A. N. Skodras
STACS
2010
Springer
14 years 4 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
FOCS
1991
IEEE
14 years 1 months ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
COMPGEOM
2010
ACM
14 years 3 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park