Sciweavers

3604 search results - page 50 / 721
» All Common Subsequences
Sort
View
ALT
2006
Springer
15 years 8 months ago
The Complexity of Learning SUBSEQ (A)
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
Stephen A. Fenner, William I. Gasarch
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
14 years 11 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman
ICASSP
2009
IEEE
15 years 6 months ago
Blind system identification for speech dereverberation with Forced Spectral Diversity
The common zeros problem for blind system identification (BSI) is well known. It degrades the performance of classic BSI algorithms and therefore imposes the limit on the perform...
Xiang Lin, Andy W. H. Khong, Patrick A. Naylor
ISWC
1999
IEEE
15 years 4 months ago
Hummingbirds Go Skiing: Using Wearable Computers to Support Social Interaction
The Hummingbird is a wearable computer that aims to support communication in co-located groups, by giving users a continuous awareness of the physical presence (or absence) of oth...
Alexandra Weilenmann, Lars Erik Holmquist
IVC
2006
113views more  IVC 2006»
14 years 11 months ago
Minimal-latency human action recognition using reliable-inference
We present a probabilistic reliable-inference framework to address the issue of rapid detection of human actions with low error rates. The approach determines the shortest video e...
James W. Davis, Ambrish Tyagi