1594 search results - page 173 / 319 » An Algorithm to Compute Collusion Paths |
149
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
178
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
176
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
159
click to vote
IPTPS
2005
Springer
15 years 12 months ago
2005
Springer
Stream-based overlay networks (SBONs) are one approach to implementing large-scale stream processing systems. A fundamental consideration in an SBON is that of service placement, ...
163
click to vote
PAM
2005
Springer
15 years 12 months ago
2005
Springer
— We have proposed a new TCP version, called ImTCP (Inline measurement TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data packets, and then utilizes the ar...