Sciweavers

360 search results - page 4 / 72
» Precision-at-ten considered redundant
Sort
View
LPNMR
2007
Springer
14 years 1 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
EUROPAR
2001
Springer
13 years 12 months ago
Load Redundancy Elimination on Executable Code
Optimizations performed at link time or directly applied to nal program executables have received increased attention in recent years. This paper discuss the discovery and elimina...
Manel Fernández, Roger Espasa, Saumya K. De...
ICIP
2006
IEEE
14 years 9 months ago
A Multi-Terminal Model-Based Video Compression Algorithm
We present a novel 3D model-based distributed video coding algorithm. It is based on independent, model-based tracking of multiple sources and distributed coding of the tracked fe...
Bi Song, Amit K. Roy Chowdhury, Ertem Tuncel
IWDC
2004
Springer
14 years 21 days ago
Reliability of VLSI Linear Arrays with Redundant Links
Reliability is one of the most important attributes of any system. Adding redundancy is one way to improve the reliability. In this paper, we consider linear VLSI arrays in which e...
Soumen Maity, Amiya Nayak, Bimal K. Roy
TC
2002
13 years 7 months ago
Finite Field Multiplier Using Redundant Representation
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhon...