Sciweavers

4886 search results - page 132 / 978
» Approximate Data Exchange
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 6 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
SPIRE
2009
Springer
16 years 17 days ago
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
Yoram Bachrach, Ralf Herbrich, Ely Porat
ICPR
2008
IEEE
16 years 14 days ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
16 years 10 days ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
16 years 10 days ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen