210 search results - page 3 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
FSTTCS
1992
Springer
13 years 9 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
DASFAA
2009
IEEE
14 years 8 days ago
2009
IEEE
Keyword search and database query are two ways for retrieving data in real world settings. In this demonstration, we show SUITS, a novel search interface over relational databases ...
DAC
2004
ACM
14 years 6 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
STACS
1997
Springer
13 years 9 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...