434 search results - page 43 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
126
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
Motivated by a probe-vehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintainin...
160
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
123
click to vote
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
— We present a solution to the problem of identifying clusters from MIMO measurement data in a data window, with a minimum of user interaction. Conventionally, visual inspection ...
121
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
145
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...