Sciweavers

5092 search results - page 681 / 1019
» Clustering the Feature Space
Sort
View
TIT
2010
82views Education» more  TIT 2010»
15 years 1 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor
ICASSP
2011
IEEE
14 years 10 months ago
Structural MAP adaptation in GMM-supervector based speaker recognition
In recent years, adaptation techniques have been given special focus in speaker recognition tasks, mainly targeting speaker and session variation disentangling under the Maximum a...
Marc Ferras, Koichi Shinoda, Sadaoki Furui
ICDE
2011
IEEE
217views Database» more  ICDE 2011»
14 years 10 months ago
Partitioning techniques for fine-grained indexing
— Many data-intensive websites use databases that grow much faster than the rate that users access the data. Such growing datasets lead to ever-increasing space and performance o...
Eugene Wu 0002, Samuel Madden
ICDE
2011
IEEE
269views Database» more  ICDE 2011»
14 years 10 months ago
Hyracks: A flexible and extensible foundation for data-intensive computing
Abstract—Hyracks is a new partitioned-parallel software platform designed to run data-intensive computations on large shared-nothing clusters of computers. Hyracks allows users t...
Vinayak R. Borkar, Michael J. Carey, Raman Grover,...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 9 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha