Sciweavers

2796 search results - page 226 / 560
» The coolest path problem
Sort
View
ECAI
1998
Springer
15 years 10 months ago
The Neural Path to Dialogue Acts
This paper presents a neural network approach to the problem of nding the dialogue act for a given utterance. So far only symbolic, decision tree and statistical approaches were ut...
M. Kipp
AAAI
2007
15 years 9 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
DKE
2007
199views more  DKE 2007»
15 years 6 months ago
QMatch - Using paths to match XML schemas
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
Naiyana Tansalarak, Kajal T. Claypool
EJWCN
2010
115views more  EJWCN 2010»
15 years 1 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
CCCG
2010
15 years 8 months ago
Watchman route in a simple polygon with a rubberband algorithm
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
Fajie Li, Reinhard Klette