1998 search results - page 206 / 400 » Complexity of the Cover Polynomial |
188
click to vote
MEDIAFORENSICS
2010
15 years 8 months ago
2010
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
200
click to vote
NIPS
2001
15 years 8 months ago
2001
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
160
click to vote
WSCG
2004
15 years 8 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
161
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
168
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...