Sciweavers

893 search results - page 130 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
WWW
2005
ACM
14 years 9 months ago
A fast XPATH evaluation technique with the facility of updates
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...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
KBSE
2009
IEEE
14 years 3 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
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...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
ROBOCOMM
2007
IEEE
14 years 3 months ago
Path planning using Shi and Karl level sets
—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...
Randeep Singh, Nagaraju Bussa
ECML
2007
Springer
14 years 3 months ago
Discriminative Sequence Labeling by Z-Score Optimization
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 ...
Elisa Ricci, Tijl De Bie, Nello Cristianini
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
14 years 3 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
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...
Luh Yen, François Fouss, Christine Decaeste...