1319 search results - page 158 / 264 » Recursive Random Fields |
125
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
169
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
125
click to vote
ECCC
2010
15 years 19 days ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
110
click to vote
TIT
2008
15 years 3 months ago
2008
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...
137
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...