359 search results - page 40 / 72 » Solving Geometric Covering Problems by Data Reduction |
136
Voted
SWAT
1994
Springer
15 years 7 months ago
1994
Springer
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...
268
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
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...
108
Voted
ISSS
1997
IEEE
15 years 7 months ago
1997
IEEE
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 ...
123
Voted
DEXA
2006
Springer
15 years 7 months ago
2006
Springer
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...
157
Voted
DAGSTUHL
1997
15 years 5 months ago
1997
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...