Sciweavers

984 search results - page 95 / 197
» ideas 2010
Sort
View
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 4 months ago
Generating code for holistic query evaluation
We present the application of customized code generation to database query evaluation. The idea is to use a collection of highly efficient code templates and dynamically instantiat...
Konstantinos Krikellas, Marcelo Cintra, Stratis Vi...
POPL
2010
ACM
16 years 1 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 1 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
16 years 1 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 1 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu