Sciweavers

837 search results - page 53 / 168
» Hard combinators
Sort
View
IH
2007
Springer
15 years 6 months ago
Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction
Abstract. Hard decisions constitute the major problem in digital watermarking applications, especially when content adaptive embedding methods are used. Soft-decision decoding, on ...
Mathias Schlauweg, Dima Pröfrock, Erika M&uum...
SEMWEB
2007
Springer
15 years 6 months ago
Lightweight Community-Driven Ontology Evolution
Only few well-maintained domain ontologies can be found on the Web. The likely reasons for the lack of useful domain ontologies include that (1) informal means to convey intended m...
Katharina Siorpaes
INFOCOM
2006
IEEE
15 years 5 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
CODES
2005
IEEE
15 years 5 months ago
DVS for buffer-constrained architectures with predictable QoS-energy tradeoffs
We present a new scheme for dynamic voltage and frequency scaling (DVS) for processing multimedia streams on architectures with restricted buffer sizes. The main advantage of our ...
Alexander Maxiaguine, Samarjit Chakraborty, Lothar...
CASES
2003
ACM
15 years 5 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...