3946 search results - page 761 / 790 » The computational complexity of choice sets |
124
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
156
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
149
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
141
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
247
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...