Sciweavers

56 search results - page 7 / 12
» The Speed of Hereditary Properties of Graphs
Sort
View
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
14 years 17 days ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
OOPSLA
2000
Springer
13 years 11 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
FOCS
2003
IEEE
14 years 22 days ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 9 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
PEPM
2007
ACM
14 years 1 months ago
Lowering: a static optimization technique for transparent functional reactivity
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
Kimberley Burchett, Gregory H. Cooper, Shriram Kri...