7167 search results - page 1158 / 1434 » Answer Set Programming |
135
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
195
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
186
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
240
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
: Workflow systems often present the user with rich interfaces that express all the capabilities and complexities of the application programs and the computing environments that th...
133
Voted
PODS
2002
ACM
16 years 2 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...