268 search results - page 36 / 54 » Cleaning Interval Graphs |
113
Voted
DM
2010
15 years 4 months ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
114
click to vote
ERCIMDL
2007
Springer
15 years 10 months ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
122
click to vote
ALENEX
2010
15 years 5 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
148
click to vote
ENDM
2010
15 years 4 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
170
Voted
DMDW
2000
15 years 5 months ago
2000
Data warehousing is a software infrastructure which supports OLAP applications by providing a collection of tools which allow data extraction and cleaning, data integration and ag...