Sciweavers

882 search results - page 35 / 177
» On self-embeddings of computable linear orderings
Sort
View
FSTTCS
2009
Springer
15 years 4 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
IPPS
2007
IEEE
15 years 4 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
CVPR
2009
IEEE
16 years 5 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
RECOMB
2005
Springer
15 years 10 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
ICIP
1997
IEEE
15 years 11 months ago
Higher order local autocorrelation features of PARCOR images for gesture recognition
This paper proposes a feature extraction method for gesture recognition, which is based on higher order local autocorrelation (HLAC) of PARCOR images. To extract dominant informat...
Takio Kurita, Yasuo Kobayashi, Taketoshi Mishima