6104 search results - page 1149 / 1221 » Constructing Information Bases Using Associative Structures |
222
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
124
click to vote
QEST
2008
IEEE
15 years 9 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
149
click to vote
GMP
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R2 to a...
136
click to vote
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
151
click to vote
UMUAI
1998
15 years 2 months ago
1998
We have implemented an application-independent collaboration manager, called Collagen, based on the SharedPlan theory of discourse, and used it to build a software interface agent...