Results 1  10
of
2,042
NearUniversal Cycles for Subsets Exist
, 2008
"... Let S be a cyclic nary sequence. We say that S is a universal cycle ((n,k)Ucycle) for ksubsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation to pa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Let S be a cyclic nary sequence. We say that S is a universal cycle ((n,k)Ucycle) for ksubsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation
NearUniversal Cycles for Subsets Exist
, 2009
"... Let S be a cyclic nary sequence. We say that S is a universal cycle ((n, k)Ucycle) for ksubsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation to p ..."
Abstract
 Add to MetaCart
Let S be a cyclic nary sequence. We say that S is a universal cycle ((n, k)Ucycle) for ksubsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation
A hidden Markov model for predicting transmembrane helices in protein sequences
 In Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB
, 1998
"... A novel method to model and predict the location and orientation of alpha helices in membrane spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core, ..."
Abstract

Cited by 373 (9 self)
 Add to MetaCart
A novel method to model and predict the location and orientation of alpha helices in membrane spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core
Succinct indexable dictionaries with applications to encoding kary trees and multisets
 In Proceedings of the 13th Annual ACMSIAM Symposium on Discrete Algorithms (SODA
"... We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,...,m − 1} for some integer m, while supporting the operations of rank(x), which returns the number of elements in S that are less than x if x ∈ S, and −1 otherwise; and select(i) which returns the ith smallest ele ..."
Abstract

Cited by 259 (16 self)
 Add to MetaCart
structure, including: • an informationtheoretically optimal representation of a kary cardinal tree that supports standard operations in constant time, • a representation of a multiset of size n from {0,...,m − 1} in B(n,m+n) + o(n) bits that supports (appropriate generalizations of) rank and select
Cyclic operads and cyclic homology
 in &quot;Geometry, Topology and Physics,&quot;International
, 1995
"... The cyclic homology of associative algebras was introduced by Connes [4] and Tsygan [22] in order to extend the classical theory of the Chern character to the noncommutative setting. Recently, there has been increased interest in more general algebraic structures than associative algebras, characte ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
which are best explained using the concept of an operad. In this approach to universal algebra, an algebraic structure is described by giving, for each n ≥ 0, the space P(n) of all nary expressions which can be formed from the operations in the given algebraic structure, modulo the universally valid
Joint MAP registration and highresolution image estimation using a sequence of undersampled images
 IEEE Transactions on Image Processing
, 1997
"... Abstract — In many imaging systems, the detector array is not sufficiently dense to adequately sample the scene with the desired field of view. This is particularly true for many infrared focal plane arrays. Thus, the resulting images may be severely aliased. This paper examines a technique for esti ..."
Abstract

Cited by 219 (2 self)
 Add to MetaCart
for estimating a highresolution image, with reduced aliasing, from a sequence of undersampled frames. Several approaches to this problem have been investigated previously. However, in this paper a maximum a posteriori (MAP) framework for jointly estimating image registration parameters and the high
Scheduling Dynamic Dataflow Graphs With Bounded Memory Using The Token Flow Model
, 1993
"... This paper builds upon research by Lee [1] concerning the token flow model, an analytical model for the behavior of dataflow graphs with datadependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state. Neces ..."
Abstract

Cited by 232 (5 self)
 Add to MetaCart
This paper builds upon research by Lee [1] concerning the token flow model, an analytical model for the behavior of dataflow graphs with datadependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state
FUZZY nARY GROUPS AS A GENERALIZATION OF ROSENFELD’S FUZZY GROUPS
, 710
"... Abstract. The notion of an nary group is a natural generalization of the notion of a group and has many applications in different branches. In this paper, the notion of (normal) fuzzy nary subgroup of an nary group is introduced and some related properties are investigated. Characterizations of f ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
of fuzzy nary subgroups are given. 1. Preliminaries A nonempty set G together with one nary operation f: Gn − → G, where n ≥ 2, is called an nary groupoid and is denoted by (G, f). According to the general convention used in the theory of nary groupoids the sequence of elements xi, xi+1,...,xj
A problem related to the Smarandache nary power sieve
"... Abstract For any fixed positive integer k ≥ 2, the power k sieve is defined as following: Starting to count on the natural numbers set at any step from 1: delete every 2kth numbers; delete, from the remaining ones, every 3kth numbers · · · , and so on: delete, from the remaining ones, every nk ..."
Abstract
 Add to MetaCart
nkth numbers, n = 2, 3, 4, · · ·. In this paper, we study the following two problems: (A) Are there an infinity of primes that belong to this sequence? (B) Are there an infinity of numbers of this sequence which are not prime? Then we using the elementary methods to study these problems
A quickstart in frequent structure mining can make a difference
 In Proc. of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD2004
, 2004
"... Given a database, structure mining algorithms search for substructures that satisfy constraints such as minimum frequency, minimum confidence, minimum interest and maximum frequency. Examples of substructures include graphs, trees and paths. For these substructures many mining algorithms have bee ..."
Abstract

Cited by 159 (5 self)
 Add to MetaCart
of increasing complexity. We introduce the GrAph/Sequence/Tree extractiON (Gaston) algorithm that implements this idea by searching first for frequent paths, then frequent free trees and finally cyclic graphs. We investigate two alternatives for computing the frequency of structures and present experimental
Results 1  10
of
2,042