1552 search results - page 238 / 311 » On the Complexity of Constant Propagation |
155
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
182
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...
176
click to vote
EDOC
2002
IEEE
15 years 11 months ago
2002
IEEE
Continuous change of user requirements has become a constant for geo-information systems. Designing systems that can adapt to such changes requires an appropriate ethodology that ...
193
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
178
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...