Searching for "Querying complex requirements." – sorted by Relevance.
-
Regular Languages are Testable with a Constant Number of Queries
- ~ O(1=) bits of w. This query complexity is shown to be optimal up to a factor poly-logarithmic in 1
- Cited by 63 (20 self) – Add To MetaCart
-
Learning the semantics of multimedia queries and concepts from a small number of examples
- to answering complex semantic queries [5, 15] alleviate the problem to some extent but are useful only
- Cited by 24 (3 self) – Add To MetaCart
-
Distribution-free property testing
- there is a gap between the query complexity required for the different settings. General techniques
- Cited by 8 (0 self) – Add To MetaCart
-
Proof Checking and Approximation: Towards Tight Results
- the query complexity required to get the same error. The second characterization constrains the free bit
- Cited by 13 (0 self) – Add To MetaCart

