Sciweavers

315 search results - page 40 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
114
Voted
PVLDB
2008
201views more  PVLDB 2008»
15 years 1 days ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
82
Voted
ALT
2009
Springer
15 years 9 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...
DEXA
2003
Springer
135views Database» more  DEXA 2003»
15 years 5 months ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
101
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 6 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
86
Voted
ICPR
2002
IEEE
16 years 1 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...