Sciweavers

23 search results - page 3 / 5
» A Formal Scheme for Multimodal Grammars
Sort
View
CVPR
2006
IEEE
13 years 11 months ago
Recognition of Composite Human Activities through Context-Free Grammar Based Representation
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...
Michael S. Ryoo, J. K. Aggarwal
ICEIS
2000
IEEE
13 years 9 months ago
Syntax-Directed Translation Schemes for Multi-Agent Systems Conversation Modelling
: In modern organisations the monolithic information systems of the past are being gradually replaced by networked systems, enabling distributed computing often based on multi-agen...
Ana L. N. Fred, Joaquim Filipe
LREC
2008
90views Education» more  LREC 2008»
13 years 6 months ago
Navigating through Dense Annotation Spaces
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
Branimir Boguraev, Mary S. Neff
TEC
2012
234views Formal Methods» more  TEC 2012»
11 years 7 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
13 years 9 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich