Sciweavers

736 search results - page 66 / 148
» A dynamic data structure for approximate range searching
Sort
View
CSFW
2010
IEEE
14 years 20 days ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
13 years 14 days ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
14 years 2 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 1 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
WEBDB
1998
Springer
106views Database» more  WEBDB 1998»
14 years 29 days ago
Interactive Query and Search in Semistructured Databases
Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web ...
Roy Goldman, Jennifer Widom