1941 search results - page 108 / 389 » On the Hardness of Approximate Reasoning |
170
Voted
CSL
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
223
Voted
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
212
Voted
VLDB
2005
ACM
16 years 1 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
188
Voted
GEOINFO
2004
15 years 9 months ago
2004
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
176
click to vote
IMA
2007
Springer
16 years 1 months ago
2007
Springer
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...