6274 search results - page 1139 / 1255 » From query complexity to computational complexity |
126
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
135
click to vote
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
150
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an event-driven video adaptation system in this paper. Events are detected by audio/video analysis and annotated by the description schemes (DSs) provided by MPEG-7 Mul...
133
click to vote
SYNASC
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
138
click to vote
ECWEB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Semantic Web Services can be seen as remote Problem Solving Methods offered via the Web through platform and language independent interfaces. They can be seamlessly inte...