Sciweavers

9719 search results - page 216 / 1944
» Answer Set Optimization
Sort
View
STACS
2007
Springer
16 years 22 days ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
EUROPAR
1999
Springer
15 years 11 months ago
I/O-Conscious Tiling for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Du...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
15 years 10 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters
WAE
2000
128views Algorithms» more  WAE 2000»
15 years 8 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
SIAMJO
2000
113views more  SIAMJO 2000»
15 years 6 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel