TIT 2008 - PDF Preprint Papers

TIT 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TIT-2008 Paper

click to vote

TIT
2008

224views more TIT 2008»

Graph-Based Semi-Supervised Learning and Spectral Kernel Design

13 years 4 months ago

Download www.stat.rutgers.edu

We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...

Rie Johnson, Tong Zhang

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	224	Graph-Based Semi-Supervised Learning and Spectral Kernel Design	claim
2	187	The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement	claim
3	171	Interference Alignment and Degrees of Freedom of the K-User Interference Channel	claim
4	164	Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes	claim
5	150	A New Approach for Mutual Information Analysis of Large Dimensional Multi-Antenna Channels	claim
6	149	An Improved Bound on the List Error Probability and List Distance Properties	claim
7	147	On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes	claim
8	141	Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime	claim
9	140	A Resource Framework for Quantum Shannon Theory	claim
10	139	Asymptotic Optimality Theory for Decentralized Sequential Hypothesis Testing in Sensor Networks	claim
11	135	New MDS or Near-MDS Self-Dual Codes	claim
12	134	Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis	claim
13	133	On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations	claim
14	132	Locally Optimum Detection of Signals in Multiplicative and First-Order Markov Additive Noises	claim
15	130	Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity	claim
16	129	Serial Schedules for Belief-Propagation: Analysis of Convergence Time	claim
17	129	Cooperative Fading Regions for Decode and Forward Relaying	claim
18	127	Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality	claim
19	127	List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity	claim
20	123	Classes of Quadratic APN Trinomials and Hexanomials and Related Structures	claim
21	123	Geometric Upper Bounds on Rates of Variable-Basis Approximation	claim
22	122	An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes	claim
23	122	Identifying Codes and Covering Problems	claim
24	121	Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels	claim
25	121	Stability Results for Random Sampling of Sparse Trigonometric Polynomials	claim
26	119	Asymptotic Properties of the Detrended Fluctuation Analysis of Long-Range-Dependent Processes	claim
27	119	Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks	claim
28	119	Bit-Level Equalization and Soft Detection for Gray-Coded Multilevel Modulation	claim
29	118	Discrete-Input Two-Dimensional Gaussian Channels With Memory: Estimation and Information Rates Via Graphical Models and Statistical Mechanics	claim
30	117	Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks	claim
31	116	On the Complexity of Hardness Amplification	claim
32	115	Affine Reflection Group Codes	claim
33	112	Rainbow Network Flow of Multiple Description Codes	claim
34	111	The Bounded-Storage Model in the Presence of a Quantum Adversary	claim
35	110	Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy	claim
36	110	Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel	claim
37	109	Statistical Analysis of Bayes Optimal Subset Ranking	claim
38	109	Joint Source-Channel Codes for MIMO Block-Fading Channels	claim
39	108	Capacity Achieving LDPC Codes Through Puncturing	claim
40	107	MIMO Diversity in the Presence of Double Scattering	claim
41	107	Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers	claim
42	106	Byzantine Modification Detection in Multicast Networks With Random Network Coding	claim
43	106	Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators	claim
44	106	Design of Spherical Lattice Space-Time Codes	claim
45	106	Constrained Sequential Resource Allocation and Guessing Games	claim
46	105	Network Coding Capacity With a Constrained Number of Coding Nodes	claim
47	105	State Discrimination With Post-Measurement Information	claim
48	103	Improved Probabilistic Bounds on Stopping Redundancy	claim
49	103	Fast Distributed Algorithms for Computing Separable Functions	claim
50	102	Extremal Problems of Information Combining	claim
51	102	State Estimation With Initial State Uncertainty	claim
52	102	Approaching the Zero-Outage Capacity of MIMO-OFDM Without Instantaneous Water-Filling	claim
53	102	On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes	claim
54	102	Average Stopping Set Weight Distributions of Redundant Random Ensembles	claim
55	101	Low-Rate Repeat-Zigzag-Hadamard Codes	claim
56	100	Communication Via Decentralized Processing	claim
57	99	On the Connection-Level Stability of Congestion-Controlled Communication Networks	claim
58	99	Distortion Control for Delay-Sensitive Sources	claim
59	98	Multiuser Successive Refinement and Multiple Description Coding	claim
60	97	Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets	claim
61	96	Source Coding With Distortion Side Information	claim
62	95	Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels	claim
63	95	Distributed Estimation Via Random Access	claim
64	95	Mutual Information and Conditional Mean Estimation in Poisson Channels	claim
65	95	On the Delay and Throughput Gains of Coding in Unreliable Networks	claim
66	94	Why Do Block Length and Delay Behave Differently if Feedback Is Present?	claim
67	93	Aspects of Pairing Inversion	claim
68	92	Capacity of Ultra-Wideband Power-Constrained Ad Hoc Networks	claim
69	92	Doppler Resilient Golay Complementary Waveforms	claim
70	92	Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem	claim
71	91	Uncoded Transmission Is Exactly Optimal for a Simple Gaussian "Sensor" Network	claim
72	90	On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection	claim
73	90	An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels	claim
74	90	Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case	claim
75	89	Lautum Information	claim
76	89	Energy-Efficient Transmissions With Individual Packet Delay Constraints	claim
77	89	Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-Alphabet Memoryless Sources	claim
78	88	Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels	claim
79	87	Performance of Parallel Concatenated Coding Schemes	claim
80	87	On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes	claim
81	87	Coding Theorems on the Threshold Scheme for a General Source	claim
82	87	Decode-and-Forward Relaying With Quantized Channel State Feedback: An Outage Exponent Analysis	claim
83	87	Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding	claim
84	86	On the Minimum Entropy of a Mixture of Unimodal and Symmetric Distributions	claim
85	86	An Improved Outer Bound for Multiterminal Source Coding	claim
86	86	Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs	claim
87	86	A One-to-One Code and Its Anti-Redundancy	claim
88	85	Undersmoothed Kernel Entropy Estimators	claim
89	84	Capacity Bounds for Sticky Channels	claim
90	84	Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds	claim
91	84	Broadcast in MIMO Systems Based on a Generalized QR Decomposition: Signaling and Performance Analysis	claim
92	84	Information Theoretic Bounds on Authentication Systems in Query Model	claim
93	84	Optimal Universal Schedules for Discrete Broadcast	claim
94	84	Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel	claim
95	84	Cooperative Multiple-Access Encoding With States Available at One Transmitter	claim
96	84	A Note on Rate-Distortion Functions for Nonstationary Gaussian Autoregressive Processes	claim
97	83	Constrained Codes as Networks of Relations	claim
98	83	Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean	claim
99	83	Hard Problems of Algebraic Geometry Codes	claim
100	83	On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case	claim
101	83	The Information Lost in Erasures	claim
102	82	ZRM Codes	claim
103	82	Error Control Codes for Parallel Asymmetric Channels	claim
104	81	Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints	claim
105	81	Codes Defined by Forms of Degree 2 on Quadric Surfaces	claim
106	81	Large Deviations of the Interference in a Wireless Communication Model	claim
107	81	How to Filter an "Individual Sequence With Feedback"	claim
108	80	Entropy Amplification Property and the Loss for Writing on Dirty Paper	claim
109	79	On the Outage Capacity Distribution of Correlated Keyhole MIMO Channels	claim
110	79	Outage Capacity of MIMO Poisson Fading Channels	claim
111	79	Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption	claim
112	78	Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications	claim
113	78	New Binary Sequences With Optimal Autocorrelation Magnitude	claim
114	78	Universal Lossless Compression of Erased Symbols	claim
115	76	Improved Risk Tail Bounds for On-Line Algorithms	claim
116	76	A Quasi-Random Approach to Space-Time Codes	claim
117	76	On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication	claim
118	76	Worst Case Nonzero-Error Interactive Communication	claim
119	75	Linear Network Codes and Systems of Polynomial Equations	claim
120	75	Diversity-Multiplexing Tradeoff and Outage Performance for Rician MIMO Channels	claim
121	74	Optimal Parsing Trees for Run-Length Coding of Biased Data	claim
122	74	Sum Capacity of One-Sided Parallel Gaussian Interference Channels	claim
123	74	Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem	claim
124	74	Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication	claim
125	73	Turbo Codes in Binary Erasure Channel	claim
126	73	Security Aspects of the Authentication Used in Quantum Cryptography	claim
127	73	L-CAMP: Extremely Local High-Performance Wavelet Representations in High Spatial Dimension	claim
128	73	Detection of Information Flows	claim
129	72	On the Construction of (Explicit) Khodak's Code and Its Analysis	claim
130	71	Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems	claim
131	71	On the Optimal Number of Active Receivers in Fading Broadcast Channels	claim
132	69	Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials	claim
133	68	A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels	claim
134	68	Signaling Over Arbitrarily Permuted Parallel Channels	claim
135	68	On the Hardness of Decoding the Gale-Berlekamp Code	claim
136	67	Tracking the Best Quantizer	claim
137	66	State Amplification	claim
138	65	Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels	claim
139	64	Fundamental Limits of Linear Equalizers: Diversity, Capacity, and Complexity	claim
140	63	Information Consistency of Nonparametric Gaussian Process Methods	claim
141	62	Diversity Embedded Space-Time Codes	claim
142	62	A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data	claim
143	61	Performance of Space-Time Codes: Gallager Bounds and Weight Enumeration	claim
144	61	A Probabilistic Upper Bound on Differential Entropy	claim
145	59	Results of the Enumeration of Costas Arrays of Order 27	claim
146	58	Universal Algorithms for Channel Decoding of Uncompressed Sources	claim
147	58	On Information Embedding When Watermarks and Covertexts are Correlated	claim
148	55	On the Performance of Clustering in Hilbert Spaces	claim
149	54	Exponential Diversity Achieving Spatio-Temporal Power Allocation Scheme for Fading Channels	claim
150	52	Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families	claim
151	51	Spectral Relations for Multidimensional Complex Improper Stationary and (Almost) Cyclostationary Processes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers