587 search results - page 31 / 118 » Compactness of Loeb Spaces |
JSYML
2007
13 years 9 months ago
2007
Let M = M, +, <, 0, {λ}λ∈D be an ordered vector space over an ordered division ring D, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is defin...
ISVC
2009
Springer
14 years 4 months ago
2009
Springer
Group action recognition is a challenging task in computer vision due to the large complexity induced by multiple motion patterns. This paper aims at analyzing group actions in vid...
CPE
1998
Springer
14 years 2 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
CPM
1994
Springer
14 years 1 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
USS
2008
14 years 2 days ago
2008
We explore the problem of secret-key distribution in unidirectional channels, those in which a sender transmits information blindly to a receiver. We consider two approaches: (1) ...