Sciweavers

6833 search results - page 157 / 1367
» Some two-character sets
Sort
View
DAM
2008
147views more  DAM 2008»
15 years 4 months ago
Efficient edge domination in regular graphs
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
Domingos Moreira Cardoso, J. Orestes Cerdeira, Cha...
MLQ
2010
226views more  MLQ 2010»
15 years 2 months ago
The Ultrafilter Closure in ZF
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...
Gonçalo Gutierres
IPL
2011
96views more  IPL 2011»
14 years 11 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 2 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
PROVSEC
2010
Springer
15 years 2 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...