Sciweavers

342 search results - page 49 / 69
» Conjunctive Queries over Trees
Sort
View
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 10 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
DEXA
2003
Springer
108views Database» more  DEXA 2003»
14 years 1 months ago
Repairing Inconsistent Merged XML Data
XML is rapidly becoming one of the most adopted standard for information representation and interchange over the Internet. With the proliferation of mobile devices of communication...
Wilfred Ng
ICRA
2006
IEEE
139views Robotics» more  ICRA 2006»
14 years 1 months ago
Adaptive Geometric Templates for Feature Matching
Robust motion recovery in tracking multiple targets using image features is affected by difficulties in obtaining good correspondences over long sequences. Difficulties are intr...
Harini Veeraraghavan, Paul R. Schrater, Nikolaos P...
ASUNAM
2010
IEEE
13 years 9 months ago
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 12 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh