7129 search results - page 900 / 1426 » Approximation Algorithms for Treewidth |
222
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
151
click to vote
OSDI
2008
ACM
16 years 5 months ago
2008
ACM
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-...
280
click to vote
VLDB
2002
ACM
16 years 5 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
239
click to vote
VLDB
2004
ACM
16 years 5 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
217
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...