Sciweavers

106 search results - page 20 / 22
» DOM: Towards a Formal Specification
Sort
View
QEST
2010
IEEE
13 years 4 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
MMSEC
2006
ACM
195views Multimedia» more  MMSEC 2006»
14 years 7 days ago
Image annotation watermarking: nested object embedding using hypergraph model
In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image...
Claus Vielhauer, Maik Schott
CODES
2006
IEEE
14 years 10 days ago
Generic netlist representation for system and PE level design exploration
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
Bita Gorjiara, Mehrdad Reshadi, Pramod Chandraiah,...