Sciweavers

28 search results - page 3 / 6
» The Structure and Complexity of Sports Elimination Numbers
Sort
View
TLCA
2005
Springer
13 years 10 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
JAR
2006
236views more  JAR 2006»
13 years 5 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 5 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
WCNC
2010
IEEE
13 years 9 months ago
Scalable Mismatch Compensation for Time-Interleaved A/D Converters in OFDM Reception
Abstract—Realization of all-digital baseband receiver processing for multi-Gigabit communication requires analog-to-digital converters(ADCs) of sufficient rate and output resolu...
Sandeep Ponnuru, Upamanyu Madhow
ICS
2003
Tsinghua U.
13 years 10 months ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas