1952 search results - page 378 / 391 » Complete partitions of graphs |
156
click to vote
ISCA
2005
IEEE
15 years 9 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
142
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
153
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
218
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
135
click to vote
VIS
2006
IEEE
16 years 5 months ago
2006
IEEE
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...