Sciweavers

23036 search results - page 4548 / 4608
» Sketching informal presentations
Sort
View
ITPRO
2007
101views more  ITPRO 2007»
13 years 9 months ago
Beyond Search: Content Applications
Federation of Abstracting and Information Services presentation (“TheThomsonTransformation: Remaking a Global 500 Company,” http://www. nfais.org/TurnerNFAIS06.ppt). Now conten...
Stephen Buxton
TIP
2008
133views more  TIP 2008»
13 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
131views more  IVC 2007»
13 years 9 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
TIT
2008
83views more  TIT 2008»
13 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
164views more  TIT 2008»
13 years 9 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
« Prev « First page 4548 / 4608 Last » Next »