20441 search results - page 3716 / 4089 » Locally Computable Structures |
146
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
160
click to vote
DIM
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
124
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
139
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
130
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...