Sciweavers

3020 search results - page 337 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
16 years 7 days ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ICPR
2008
IEEE
16 years 8 months ago
A matrix alignment approach for link prediction
This paper introduces a new discriminative learning technique for link prediction based on the matrix alignment approach. Our algorithm automatically determines the most predictiv...
Jerry Scripps, Pang-Ning Tan, Feilong Chen, Abdol-...
ICASSP
2011
IEEE
14 years 10 months ago
Audio Signal Representations for Factorization in the Sparse Domain
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
Manuel Moussallam, Laurent Daudet, Gaël Richa...
TPDS
2010
118views more  TPDS 2010»
15 years 5 months ago
Using Parallel Bloom Filters for Multiattribute Representation on Network Services
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
Bin Xiao, Yu Hua
315
Voted
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...