973 search results - page 120 / 195 » New Bounds on Crossing Numbers |
157
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Fusing partial estimates is a critical and common problem
in many computer vision tasks such as part-based detection
and tracking. It generally becomes complicated and
intractab...
145
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
171
click to vote
EACL
2009
ACL Anthology
16 years 6 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
200
click to vote
ISPEC
2009
Springer
16 years 29 days ago
2009
Springer
We propose two symmetric-key management schemes for the encryption of scalable compressed video content. The schemes are applicable to MPEG-4 Fine Grain Scalability video coding. O...
174
click to vote
LION
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...