3172 search results - page 181 / 635 » On the Random-Self-Reducibility of Complete Sets |
175
click to vote
VL
2007
IEEE
16 years 24 days ago
2007
IEEE
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
144
click to vote
VTC
2007
IEEE
16 years 24 days ago
2007
IEEE
—A complete multiple-input multiple-output (MIMO) communication system with orthogonal frequency-division multiplexing (OFDM) based on multiple excitation modes for a single circ...
154
click to vote
AIMS
2007
Springer
16 years 21 days ago
2007
Springer
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
129
click to vote
EUROPAR
2007
Springer
16 years 21 days ago
2007
Springer
STL dictionaries like map and set are commonly used in C++ programs. We consider parallelizing two of their bulk operations, namely the construction from many elements, and the ins...
168
click to vote
FROCOS
2007
Springer
16 years 21 days ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...