Sciweavers

137 search results - page 15 / 28
» Efficient Tree Search in Encrypted Data
Sort
View
PVLDB
2010
128views more  PVLDB 2010»
13 years 4 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 10 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
MOBISYS
2004
ACM
14 years 9 months ago
Exponential Index: A Parameterized Distributed Indexing Scheme for Data on Air
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...
Jianliang Xu, Wang-Chien Lee, Xueyan Tang
ICML
2008
IEEE
14 years 10 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton