1941 search results - page 148 / 389 » On the Hardness of Approximate Reasoning |
160
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
181
click to vote
AAAI
2006
15 years 8 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
157
click to vote
PVLDB
2008
15 years 6 months ago
2008
Forms-based query interfaces are widely used to access databases today. The design of a forms-based interface is often a key step in the deployment of a database. Each form in suc...
285
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
157
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...