Sciweavers

4126 search results - page 682 / 826
» Relationships with other Formalisms
Sort
View
TASLP
2002
79views more  TASLP 2002»
15 years 6 months ago
Perception-based partial encryption of compressed speech
Mobile multimedia applications, the focus of many forthcoming wireless services, increasingly demand low-power techniques implementing content protection and customer privacy. In t...
Antonio Servetti, Juan Carlos De Martin
TCAD
2002
121views more  TCAD 2002»
15 years 6 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
TCS
2002
15 years 6 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
MTA
2007
111views more  MTA 2007»
15 years 5 months ago
Story creation from heterogeneous data sources
There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we f...
Marat Fayzullin, V. S. Subrahmanian, Massimiliano ...
MICS
2008
87views more  MICS 2008»
15 years 5 months ago
Spurious Disambiguation Errors and How to Get Rid of Them
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
Claudio Sacerdoti Coen, Stefano Zacchiroli