1355 search results - page 235 / 271 » Alternating Timed Automata over Bounded Time |
191
click to vote
SIGMOD
2006
ACM
16 years 15 hour ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
PKDD
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
101
click to vote
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
115
click to vote
CD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
105
click to vote
CLOUD
2010
ACM
15 years 5 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...