151 search results - page 11 / 31 » The Computational Complexity of Knot and Link Problems |
TKDE
2012
11 years 9 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
ECCV
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a detection-based three-level hierarchical association approach to robustly track multiple objects in crowded environments from a single camera. At the low lev...
DSN
2011
IEEE
12 years 7 months ago
2011
IEEE
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
INFOCOM
2003
IEEE
14 years 19 days ago
2003
IEEE
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...