Sciweavers

517 search results - page 77 / 104
» Computing Fuzzy Answer Sets Using dlvhex
Sort
View
IGIS
1994
145views GIS» more  IGIS 1994»
14 years 1 months ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel
DKE
2006
94views more  DKE 2006»
13 years 10 months ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis
FOCS
2009
IEEE
14 years 4 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
FOCS
2009
IEEE
14 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 10 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...