Sciweavers

359 search results - page 40 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 1 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 10 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
ISSS
1997
IEEE
107views Hardware» more  ISSS 1997»
14 years 1 months ago
Port Calling: A Transformation for Reducing I/O during Multi-Package Functional Partitioning
Partitioning a system among multiple input and output pin I O limited packages is a widely researched and hard to solve problem. We previously described a new approach yielding ...
Frank Vahid
DEXA
2006
Springer
102views Database» more  DEXA 2006»
14 years 21 days ago
Mining RDF Metadata for Generalized Association Rules
In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the overgeneraliz...
Tao Jiang, Ah-Hwee Tan
DAGSTUHL
1997
13 years 10 months ago
Scattered Data Techniques for Surfaces
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
Suresh K. Lodha, Richard Franke