45 search results - page 4 / 9 » Small Maximal Matchings in Random Graphs |
95
Voted
CVPR
2005
IEEE
16 years 6 days ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
92
Voted
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for shape matching and object recognition. However, it is well known that skeletal ...
125
Voted
SODA
2012
ACM
13 years 19 days ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...