Sciweavers

11211 search results - page 331 / 2243
» Rank-Sensitive Data Structures
Sort
View
VLDB
1990
ACM
166views Database» more  VLDB 1990»
15 years 10 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
NAR
2007
210views more  NAR 2007»
15 years 6 months ago
MIPSPlantsDB - plant database resource for integrative and comparative plant genome research
Genome-oriented plant research delivers rapidly increasing amount of plant genome data. Comprehensive and structured information resources are required to structure and communicat...
Manuel Spannagl, Octave Noubibou, Dirk Haase, Li Y...
PVLDB
2010
195views more  PVLDB 2010»
15 years 1 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
WWW
2003
ACM
16 years 7 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...
NIPS
2008
15 years 8 months ago
Kernel Measures of Independence for non-iid Data
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smo...