Sciweavers

8370 search results - page 1647 / 1674
» Challenges in P2P Computing
Sort
View
TIFS
2008
157views more  TIFS 2008»
14 years 9 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
76
Voted
TIP
2008
133views more  TIP 2008»
14 years 9 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
IVC
2007
173views more  IVC 2007»
14 years 9 months ago
Robust tracking with motion estimation and local Kernel-based color modeling
Visual tracking has been a challenging problem in computer vision over the decades. The applications of visual tracking are far-reaching, ranging from surveillance and monitoring ...
R. Venkatesh Babu, Patrick Pérez, Patrick B...
84
Voted
TIT
2008
83views more  TIT 2008»
14 years 9 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
TIT
2008
110views more  TIT 2008»
14 years 9 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
« Prev « First page 1647 / 1674 Last » Next »