Sciweavers

1411 search results - page 173 / 283
» Discriminative Random Fields
Sort
View
TCSV
2008
313views more  TCSV 2008»
13 years 10 months ago
Fast Pedestrian Detection Using a Cascade of Boosted Covariance Features
Efficiently and accurately detecting pedestrians plays a very important role in many computer vision applications such as video surveillance and smart cars. In order to find the ri...
Sakrapee Paisitkriangkrai, Chunhua Shen, Jian Zhan...
ECCV
2008
Springer
15 years 2 hour ago
Learning Optical Flow
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
Deqing Sun, Stefan Roth, J. P. Lewis, Michael J. B...
CIKM
2008
Springer
14 years 3 days ago
Identifying table boundaries in digital documents via sparse line detection
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...
Ying Liu, Prasenjit Mitra, C. Lee Giles
ECCC
2010
83views more  ECCC 2010»
13 years 7 months ago
Symmetric LDPC codes are not necessarily locally testable
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...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
TIT
2008
164views more  TIT 2008»
13 years 10 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