Sciweavers

2100 search results - page 26 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
ESOP
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
CSL
2007
Springer
13 years 7 months ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young
PR
2006
127views more  PR 2006»
13 years 7 months ago
On solving the face recognition problem with one training sample per subject
The lack of adequate training samples and the considerable variations observed in the available image collections due to aging, illumination and pose variations are the two key te...
Jie Wang, Kostas N. Plataniotis, Juwei Lu, Anastas...
DPD
1998
117views more  DPD 1998»
13 years 7 months ago
Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems
To meet users’ growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recen...
Qiang Zhu, Per-Åke Larson