Sciweavers

2131 search results - page 94 / 427
» Immunity for Closed Sets
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 4 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
SPIRE
2009
Springer
15 years 9 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
IJCAI
2001
15 years 6 months ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
ICTAI
2007
IEEE
15 years 11 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
153
Voted
ACTA
2000
82views more  ACTA 2000»
15 years 4 months ago
Semantics analysis through elementary meanings
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...
Youichi Kobuchi, Takashi Saito, Hidenobu Nunome