Sciweavers

961 search results - page 55 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 4 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
PDP
2009
IEEE
15 years 4 months ago
Byte-Range Asynchronous Locking in Distributed Settings
This paper investigate a mutual exclusion algorithm on distributed systems. We introduce a new algorithm based on the Naimi-Trehel algorithm, taking advantage of the distributed a...
Martin Quinson, Flavien Vernier
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
15 years 9 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
15 years 3 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet
PVLDB
2008
108views more  PVLDB 2008»
14 years 9 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...