1552 search results - page 165 / 311 » On the Complexity of Constant Propagation |
203
click to vote
ICC
2008
IEEE
16 years 29 days ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
206
click to vote
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
146
click to vote
VTC
2007
IEEE
16 years 23 days ago
2007
IEEE
— Channel-adaptive techniques increase the efficiency of wireless communications, as they are efficient in coping with the quality variation of the wireless channels. However, ...
144
click to vote
FUN
2007
Springer
16 years 20 days ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
171
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...