Sciweavers

CIKM
2006
Springer
13 years 8 months ago
Secure search in enterprise webs: tradeoffs in efficient implementation for document level security
Document level security (DLS)
Peter Bailey, David Hawking, Brett Matson
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
13 years 10 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
13 years 10 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 6 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
CVPR
2000
IEEE
14 years 7 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari