Sciweavers

16430 search results - page 291 / 3286
» On Computable Tree Functions
Sort
View
141
Voted
CAV
2004
Springer
152views Hardware» more  CAV 2004»
15 years 10 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
HIPC
2003
Springer
15 years 10 months ago
POMA: Prioritized Overlay Multicast in Ad Hoc Environments
Abstract: Overlay Multicast networks in mobile ad-hoc environments have received much attention due to their increasing number of practical applications. Although overlay multicast...
Abhishek P. Patil, Yunhao Liu, Lionel M. Ni, Li Xi...
AI
2011
Springer
14 years 11 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 4 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...