893 search results - page 130 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
121
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
108
click to vote
KBSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
173
click to vote
ROBOCOMM
2007
IEEE
15 years 9 months ago
2007
IEEE
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...
121
click to vote
ECML
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
128
click to vote
PAKDD
2007
ACM
15 years 9 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...