2314 search results - page 326 / 463 » Minimal Partitions of a Graph |
177
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
In this paper, we present a novel approach to recognizing human actions from different views by view knowledge transfer. An action is originally modelled as a bag of visual-words ...
137
click to vote
TELETRAFFIC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
122
click to vote
ORL
1998
15 years 3 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
210
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
126
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...