125 search results - page 5 / 25 » N Semantic Classes are Harder than Two |
WEBDB
2009
Springer
15 years 4 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
ICCD
2001
IEEE
15 years 6 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
77
Voted
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
73
Voted
JCT
2011
14 years 4 months ago
2011
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...