619 search results - page 107 / 124 » Random Bichromatic Matchings |
SIAMCOMP
2002
13 years 8 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
ICALP
2011
Springer
13 years 6 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we propose a method for human tracking using 3D human body model in a video sequence with a monocular moving camera. Tracking a human with unconstrained movement in...
EUROCRYPT
2009
Springer
14 years 9 months ago
2009
Springer
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Given a set of algorithms, which one(s) should you apply to, i) compute optical flow, or ii) perform feature matching? Would looking at the sequence in question help you decide? I...