Sciweavers

370 search results - page 30 / 74
» Bounded modified realizability
Sort
View
GLOBECOM
2008
IEEE
14 years 3 months ago
Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
Feifei Gao, Arumugam Nallanathan, Chintha Tellambu...
GLOBECOM
2007
IEEE
14 years 3 months ago
Output Traffic Characterization of Policers and Shapers with Long-Range Dependent Input Traffic
 Long-range dependence (LRD) is a largely verified property of Internet traffic, which severely affects network queuing. An approach for guaranteeing performance requirements is...
Stefano Bregni, Paolo Giacomazzi, Gabriella Saddem...
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 2 months ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini
FOSAD
2009
Springer
14 years 15 days ago
Verification of Concurrent Programs with Chalice
A program verifier is a tool that allows developers to prove that their code satisfies its specification for every possible input and every thread schedule. These lecture notes des...
K. Rustan M. Leino, Peter Müller, Jan Smans
NIPS
2008
13 years 10 months ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil