Sciweavers

263 search results - page 27 / 53
» Structure Matching for Enhancing UDDI Queries Results
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
MVA
2007
196views Computer Vision» more  MVA 2007»
13 years 9 months ago
Fingerprint Verification Using Perturbation Method
This paper describes a new, powerful technique of fingerprint verification based on a perturbation method. The proposed method consists of four parts. The first part performs loca...
Satoshi Otaka, Yoshihisa Nishiyama, Takahiro Hatan...
IGIS
1994
156views GIS» more  IGIS 1994»
13 years 11 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...