Sciweavers

697 search results - page 49 / 140
» Approximation of Information Granule Sets
Sort
View
CISS
2010
IEEE
14 years 4 months ago
On models for multi-user Gaussian channels with fading
Abstract— An analytically tractable model for Gaussian multiuser channels with fading is studied, and the capacity region of this model is found to be a good approximation of the...
Rony El Haddad, Brian Smith, Sriram Vishwanath
75
Voted
CISS
2008
IEEE
15 years 7 months ago
Progress on pricing with peering
—This paper examines a simple model of how a provider ISP charges customer ISPs by assuming the provider ISP wants to maximize its revenue when customer ISPs have the possibility...
Eui-woong Lee, David Buchfuhrer, Lachlan L. H. And...
IDA
1998
Springer
15 years 12 days ago
Fast Dimensionality Reduction and Simple PCA
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
Matthew Partridge, Rafael A. Calvo
102
Voted
IJCNN
2000
IEEE
15 years 5 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
86
Voted
VIIP
2001
15 years 2 months ago
Visualization Channels: Time Multiplexing on a Display
Large and complex information requires arbitrarily extensive displays for an exact, comprehensive visualization. This paper introduces a technique, time-multiplexing, for presenti...
Delbert Hart, Mihail Eduard Tudoreanu