Sciweavers

24188 search results - page 4474 / 4838
» Computing on Encrypted Data
Sort
View
PAMI
2007
202views more  PAMI 2007»
15 years 6 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 6 months ago
Multicast inference of temporal loss characteristics
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
Vijay Arya, Nick G. Duffield, Darryl Veitch
PR
2007
189views more  PR 2007»
15 years 6 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
PR
2007
293views more  PR 2007»
15 years 6 months ago
Mean shift-based clustering
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
Kuo-Lung Wu, Miin-Shen Yang
PRESENCE
2007
156views more  PRESENCE 2007»
15 years 6 months ago
ATLAS: A Scalable Network Framework for Distributed Virtual Environments
A distributed virtual environment (DVE) is a software system that allows users on a network to interact with each other by sharing a common view of their states. As users are geog...
Dongman Lee, Mingyu Lim, Seunghyun Han, Kyungmin L...
« Prev « First page 4474 / 4838 Last » Next »