Sciweavers

315 search results - page 44 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
123
Voted
SIGMOD
2011
ACM
203views Database» more  SIGMOD 2011»
14 years 3 months ago
Effective data co-reduction for multimedia similarity search
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
Zi Huang, Heng Tao Shen, Jiajun Liu, Xiaofang Zhou
138
Voted
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 21 days ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
FOCS
2000
IEEE
15 years 5 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
PVLDB
2008
82views more  PVLDB 2008»
15 years 1 days ago
Mining non-redundant high order correlations in binary data
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
Xiang Zhang, Feng Pan, Wei Wang 0010, Andrew B. No...
110
Voted
STACS
2005
Springer
15 years 6 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...