1421 search results - page 180 / 285 » Algorithms for subsequence combinatorics |
151
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
227
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Reliable estimation of visual saliency allows appropriate processing of images without prior knowledge of their content, and thus remains an important step in many computer vision ...
124
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
—The booming industry of location-based services has accumulated a huge collection of users’ location trajectories of driving, cycling, hiking, etc. In this work, we investigat...
146
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
154
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...