358 search results - page 68 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
PODS
2008
ACM
15 years 9 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
DELOS
2004
14 years 11 months ago
2004
Databases and Grid computing are a good match. With the service orientation of Grid computing, the complexity of maintaining and integrating databases can be kept away from the act...
CDC
2009
IEEE
14 years 10 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovati...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Detecting objects in complex scenes while recovering the scene layout is a critical functionality in many vision-based applications. Inspired by the work of [18], we advocate the ...