Sciweavers

209 search results - page 27 / 42
» t-Spanners for metric space searching
Sort
View
COCOON
1998
Springer
15 years 2 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
CVPR
2006
IEEE
15 years 12 months ago
The Bottleneck Geodesic: Computing Pixel Affinity
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
Ido Omer, Michael Werman
NDSS
2000
IEEE
15 years 2 months ago
A First Step Towards the Automatic Generation of Security Protocols
This paper describes automatic protocol generation (APG for short), a novel mechanism to generate security protocols automatically. With APG, the protocol designer inputs the spec...
Adrian Perrig, Dawn Xiaodong Song
TPDS
2002
80views more  TPDS 2002»
14 years 9 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
TVCG
2010
166views more  TVCG 2010»
14 years 8 months ago
An Extension of Wilkinson's Algorithm for Positioning Tick Labels on Axes
—The non-data components of a visualization, such as axes and legends, can often be just as important as the data itself. They provide contextual information essential to interpr...
Justin Talbot, Sharon Lin, Pat Hanrahan