268 search results - page 24 / 54 » Cleaning Interval Graphs |
127
Voted
COMGEO
2007
ACM
15 years 14 days ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
111
click to vote
DAWAK
2005
Springer
15 years 6 months ago
2005
Springer
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
AUTOMATICA
2010
15 years 18 days ago
2010
The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for swarm motion towards a goal, for biological systems to...
80
Voted
ACL
1998
15 years 1 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...