Sciweavers

2661 search results - page 154 / 533
» Quantum Complexity Classes
Sort
View
IJAC
2007
116views more  IJAC 2007»
15 years 3 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
149
Voted
IVC
2002
143views more  IVC 2002»
15 years 3 months ago
Towards the automatic analysis of complex human body motions
The classification of human body motion is an integral component for the automatic interpretation of video sequences. In a first part we present an effective approach that uses mi...
Jens Rittscher, Andrew Blake, Stephen J. Roberts
125
Voted
ICML
1999
IEEE
16 years 4 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
CSL
2009
Springer
15 years 7 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
132
Voted
PR
2000
82views more  PR 2000»
15 years 3 months ago
Holistic recognition of handwritten character pairs
Researchers have thus far focused on the recognition of alpha and numeric characters in isolation as well as in context. In this paper we introduce a new genre of problems where t...
Xian Wang, Venu Govindaraju, Sargur N. Srihari