Sciweavers

1199 search results - page 223 / 240
» Parameterized Proof Complexity
Sort
View
MEMOCODE
2010
IEEE
13 years 5 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 4 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
JACM
2010
120views more  JACM 2010»
13 years 2 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
PLDI
2012
ACM
11 years 10 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa