Sciweavers

170 search results - page 15 / 34
» A Bounding Quantifier
Sort
View
INFOCOM
1992
IEEE
15 years 3 months ago
A Study on the Inaccessibility Characteristics of ISO 8802/4 Token-Bus LANs
Local area networks have long been established as the basis for distributed systems. Continuity of service and bounded and known message delivery latency are requirements of a num...
José Rufino, Paulo Veríssimo
FSTTCS
2006
Springer
15 years 3 months ago
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
Tanmoy Chakraborty, Samir Datta
ESANN
2006
15 years 1 months ago
Topological Correlation
Quantifying the success of the topographic preservation achieved with a neural map is difficult. In this paper we present Topological Correlation, Tc, a method that assesses the de...
Kevin Doherty, Rod Adams, Neil Davey
CSL
2010
Springer
15 years 25 days ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
ICASSP
2010
IEEE
14 years 12 months ago
Statistical Resolution Limit for multiple parameters of interest and for multiple signals
The concept of Statistical Resolution Limit (SRL), which is defined as the minimal separation to resolve two closely spaced signals, is an important tool to quantify performance ...
Mohammed Nabil El Korso, Rémy Boyer, Alexan...