Sciweavers

389 search results - page 12 / 78
» Some natural decision problems in automatic graphs
Sort
View
JAIR
2006
157views more  JAIR 2006»
13 years 7 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
CICLING
2005
Springer
14 years 27 days ago
Automatic Time Expression Labeling for English and Chinese Text
In this paper, we describe systems for automatic labeling of time expressions occurring in English and Chinese text as specified in the ACE Temporal Expression Recognition and Nor...
Kadri Hacioglu, Ying Chen, Benjamin Douglas
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
13 years 11 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
GG
2004
Springer
14 years 22 days ago
A Perspective on Graphs and Access Control Models
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...
Ravi S. Sandhu
DICTA
2003
13 years 8 months ago
Automatic Adaptive Segmentation of Moving Objects Based on Spatio-Temporal Information
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
Ofer Miller, Amir Averbuch, Yosi Keller