Sciweavers

13 search results - page 2 / 3
» Efficient Private Matching and Set Intersection
Sort
View
COMPGEOM
2001
ACM
13 years 9 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ICPR
2008
IEEE
14 years 7 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
ICIP
2003
IEEE
14 years 7 months ago
An efficient algorithm for extraction of anatomical structures in retinal images
This paper presents efficient methods for automatic detection and extraction of blood vessels and optic disc (OD) both of which are two prominent anatomical structures in ocular f...
Thitiporn Chanwimaluang, Guoliang Fan
CCS
2010
ACM
13 years 6 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
ANCS
2005
ACM
13 years 11 months ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...